Submission #998211
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
template<class V,int NV> class SegTree_1 {
public:
vector<V> val;
static V const def=-1LL<<60;
V comp(V l,V r){ return max(l,r);};
SegTree_1(){val=vector<V>(NV*2,def);};
V getval(int x,int y,int l=0,int r=NV,int k=1) { // x<=i<y
if(r<=x || y<=l) return def;
if(x<=l && r<=y) return val[k];
return comp(getval(x,y,l,(l+r)/2,k*2),getval(x,y,(l+r)/2,r,k*2+1));
}
void update(int entry, V v) {
entry += NV;
val[entry]=v;
while(entry>1) entry>>=1, val[entry]=comp(val[entry*2],val[entry*2+1]);
}
};
int N,M,K;
ll A[101010];
ll from[101010],to[101010];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N>>M>>K;
FOR(i,N) cin>>A[i];
FOR(i,N) from[i]=A[i];
FOR(i,K-1) {
deque<pair<ll,int>> Q;
FOR(j,N) {
if(Q.empty()) {
to[j]=-1LL<<60;
}
else {
while(Q.size() && j-Q.front().second>M) Q.pop_front();
to[j]=(i+2)*A[j] + Q.front().first;
}
while(Q.size() && Q.back().first<=from[j]) Q.pop_back();
Q.push_back({from[j],j});
}
swap(from,to);
}
cout<<*max_element(from,from+N)<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
Submission Info
Submission Time |
|
Task |
A - Struck Out |
User |
kmjp |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1784 Byte |
Status |
AC |
Exec Time |
520 ms |
Memory |
2688 KB |
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, 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 |
6 ms |
1792 KB |
sample_2.txt |
AC |
6 ms |
1792 KB |
sample_3.txt |
AC |
6 ms |
1792 KB |
subtask_1_1.txt |
AC |
9 ms |
1792 KB |
subtask_1_2.txt |
AC |
77 ms |
1920 KB |
subtask_1_3.txt |
AC |
454 ms |
2688 KB |
subtask_1_4.txt |
AC |
11 ms |
1920 KB |
subtask_1_5.txt |
AC |
21 ms |
2560 KB |
subtask_1_6.txt |
AC |
27 ms |
1792 KB |
subtask_1_7.txt |
AC |
161 ms |
2688 KB |
subtask_1_8.txt |
AC |
455 ms |
2688 KB |
subtask_1_9.txt |
AC |
39 ms |
1792 KB |
subtask_2_1.txt |
AC |
9 ms |
1792 KB |
subtask_2_2.txt |
AC |
7 ms |
1792 KB |
subtask_2_3.txt |
AC |
8 ms |
1792 KB |
subtask_2_4.txt |
AC |
9 ms |
1792 KB |
subtask_2_5.txt |
AC |
9 ms |
1792 KB |
subtask_2_6.txt |
AC |
9 ms |
1792 KB |
subtask_2_7.txt |
AC |
9 ms |
1792 KB |
subtask_2_8.txt |
AC |
9 ms |
1792 KB |
subtask_2_9.txt |
AC |
8 ms |
1792 KB |
subtask_3_1.txt |
AC |
58 ms |
2560 KB |
subtask_3_2.txt |
AC |
59 ms |
2688 KB |
subtask_3_3.txt |
AC |
57 ms |
2688 KB |
subtask_3_4.txt |
AC |
49 ms |
2432 KB |
subtask_3_5.txt |
AC |
11 ms |
1920 KB |
subtask_3_6.txt |
AC |
38 ms |
2688 KB |
subtask_3_7.txt |
AC |
58 ms |
2688 KB |
subtask_3_8.txt |
AC |
13 ms |
1920 KB |
subtask_3_9.txt |
AC |
62 ms |
2688 KB |
subtask_4_1.txt |
AC |
455 ms |
2688 KB |
subtask_4_10.txt |
AC |
432 ms |
2688 KB |
subtask_4_11.txt |
AC |
520 ms |
2688 KB |
subtask_4_12.txt |
AC |
511 ms |
2688 KB |
subtask_4_13.txt |
AC |
504 ms |
2688 KB |
subtask_4_2.txt |
AC |
495 ms |
2688 KB |
subtask_4_3.txt |
AC |
454 ms |
2688 KB |
subtask_4_4.txt |
AC |
455 ms |
2560 KB |
subtask_4_5.txt |
AC |
391 ms |
2688 KB |
subtask_4_6.txt |
AC |
48 ms |
2688 KB |
subtask_4_7.txt |
AC |
267 ms |
2688 KB |
subtask_4_8.txt |
AC |
448 ms |
2560 KB |
subtask_4_9.txt |
AC |
219 ms |
2688 KB |