Submission #2140301
Source Code Expand
// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}
const int N = 1e5 + 10;
const ll inf = 1e18;
int m , n , K , a[N];
ll f[N] , g[N];
pair<ll,int> dp[N];
int main(){
scanf("%d%d%d",&n,&m,&K);
rep(i,1,n+1) scanf("%d",a+i);
rep(i,1,n+1) f[i] = a[i];
rep(t,2,K+1) {
int l = 0 , r = 0;
rep(i,1,n+1) {
while(l < r && i - dp[l].se > m)
++l;
g[i] = l != r ? dp[l].fi + ll(t) * a[i] : -inf;
if(f[i] != -inf) {
while(l < r && f[i] >= dp[r - 1].fi)
--r;
dp[r++] = mp(f[i] , i);
}
}
rep(i,1,n+1) f[i] = g[i];
}
printf("%lld\n",*max_element(f+1,f+1+n));
return 0;
}
Submission Info
Submission Time
2018-02-27 17:10:07+0900
Task
A - Struck Out
User
Y_UME
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1397 Byte
Status
AC
Exec Time
386 ms
Memory
2944 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:44:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&n,&m,&K);
^
./Main.cpp:45:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,1,n+1) scanf("%d",a+i);
^
Judge Result
Set Name
Sample
subtask1
subtask2
subtask3
All
Score / Max Score
0 / 0
100 / 100
200 / 200
300 / 300
100 / 100
Status
Set Name
Test Cases
Sample
sample_1.txt, sample_2.txt, sample_3.txt
subtask1
sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2
sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt
subtask3
sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt
All
sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt
Case Name
Status
Exec Time
Memory
sample_1.txt
AC
1 ms
256 KB
sample_2.txt
AC
1 ms
256 KB
sample_3.txt
AC
1 ms
256 KB
subtask_1_1.txt
AC
1 ms
256 KB
subtask_1_2.txt
AC
36 ms
512 KB
subtask_1_3.txt
AC
374 ms
2176 KB
subtask_1_4.txt
AC
4 ms
384 KB
subtask_1_5.txt
AC
18 ms
2176 KB
subtask_1_6.txt
AC
1 ms
256 KB
subtask_1_7.txt
AC
133 ms
2176 KB
subtask_1_8.txt
AC
376 ms
2176 KB
subtask_1_9.txt
AC
2 ms
256 KB
subtask_2_1.txt
AC
1 ms
256 KB
subtask_2_2.txt
AC
1 ms
256 KB
subtask_2_3.txt
AC
1 ms
256 KB
subtask_2_4.txt
AC
1 ms
256 KB
subtask_2_5.txt
AC
1 ms
256 KB
subtask_2_6.txt
AC
1 ms
256 KB
subtask_2_7.txt
AC
1 ms
256 KB
subtask_2_8.txt
AC
1 ms
256 KB
subtask_2_9.txt
AC
1 ms
256 KB
subtask_3_1.txt
AC
48 ms
2176 KB
subtask_3_2.txt
AC
48 ms
2176 KB
subtask_3_3.txt
AC
47 ms
2176 KB
subtask_3_4.txt
AC
39 ms
1792 KB
subtask_3_5.txt
AC
3 ms
384 KB
subtask_3_6.txt
AC
30 ms
2176 KB
subtask_3_7.txt
AC
49 ms
2176 KB
subtask_3_8.txt
AC
6 ms
512 KB
subtask_3_9.txt
AC
48 ms
2176 KB
subtask_4_1.txt
AC
372 ms
2176 KB
subtask_4_10.txt
AC
289 ms
2944 KB
subtask_4_11.txt
AC
386 ms
2432 KB
subtask_4_12.txt
AC
382 ms
2304 KB
subtask_4_13.txt
AC
378 ms
2176 KB
subtask_4_2.txt
AC
373 ms
2176 KB
subtask_4_3.txt
AC
375 ms
2176 KB
subtask_4_4.txt
AC
372 ms
2176 KB
subtask_4_5.txt
AC
316 ms
2176 KB
subtask_4_6.txt
AC
40 ms
2176 KB
subtask_4_7.txt
AC
202 ms
2176 KB
subtask_4_8.txt
AC
366 ms
2176 KB
subtask_4_9.txt
AC
171 ms
2176 KB