#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
int n,k;
ll A[100005];
ll dp1[100005];
ll dp2[100005];
ll sum[100005];
struct line {
ll tan,y;
int idx;
};
line L[100005];
int sz,p;
inline ld inter(line a,line b) {
if(a.tan==b.tan) {
return 1000000000000000000ll;
}
return (ld)(a.y-b.y)/(ld)(b.tan-a.tan);
}
inline void linepush(ll tan,ll y,int idx) {
line s;
s.tan=tan; s.y=y; s.idx=idx;
while(sz>=2 && inter(L[sz-1],s) < inter(L[sz-2],L[sz-1]) ) {
sz--;
if(p>=sz) p--;
}
L[sz++]=s;
}
int via[201][100005];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>A[i];
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+A[i];
for(int i=1;i<=n;i++) {
dp1[i]=sum[i]*(sum[n]-sum[i]);
}
for(int i=1;i<=k;i++)for(int j=1;j<=n;j++)via[i][j]=-1;
for(int i1=2;i1<=k;i1++) {
sz=0,p=-1;
linepush(sum[i1-1],dp1[i1-1]-sum[n]*sum[i1-1],i1-1);
for(int i=i1;i<=n;i++) {
while(p<sz-1 && inter(L[p],L[p+1]) <= sum[i]) p++;
dp2[i] = L[p].tan*sum[i] + L[p].y + sum[i]*sum[n] - sum[i]*sum[i];
via[i1][i]=L[p].idx;
linepush(sum[i], dp1[i]-sum[n]*sum[i], i);
}
for(int i=1;i<=n;i++) {
dp1[i]=dp2[i];
dp2[i]=0;
}
}
ll _max = 0; int maxidx=1;
for(int i=1;i<=n;i++) {
if(_max < dp1[i]) {
_max = dp1[i];
maxidx= i;
}
}
vector<int> v;
for(int i=k;i>=1;i--) {
v.push_back(maxidx);
maxidx=via[i][maxidx];
}
reverse(v.begin(),v.end());
cout<<_max<<"\n";
for(int i=0;i<v.size();i++) {
cout<<v[i]<<' ';
}
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v.size();i++) {
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Incorrect |
0 ms |
86164 KB |
Integer 0 violates the range [1, 9] |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Incorrect |
0 ms |
86164 KB |
Integer 0 violates the range [1, 49] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Incorrect |
0 ms |
86164 KB |
Integer 0 violates the range [1, 199] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
86164 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
86164 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
86164 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
86164 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Incorrect |
3 ms |
86164 KB |
Integer 0 violates the range [1, 999] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
86164 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
46 ms |
86164 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
86164 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
43 ms |
86164 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
49 ms |
86164 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
59 ms |
86164 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Incorrect |
29 ms |
86164 KB |
Integer 0 violates the range [1, 9999] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
86164 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
9 ms |
86164 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
459 ms |
86164 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
13 ms |
86164 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
776 ms |
86164 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
453 ms |
86164 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
633 ms |
86164 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Incorrect |
393 ms |
86164 KB |
Integer 0 violates the range [1, 99999] |
| 9 |
Halted |
0 ms |
0 KB |
- |
