#include<bits/stdc++.h>
#define MAX_N 100005
#define sq(x) ((x)*(x))
using namespace std;
typedef long long LL;
struct node{
LL a,b,idx;
}fc[MAX_N],nfc[MAX_N];
LL n,k,sum[MAX_N],dp[MAX_N];
LL s,e,ns,ne,ans,anss[MAX_N],ansn;
int from[205][MAX_N];
bool is_ok(node x,node y,node z){return (x.a-y.a)*(z.b-x.b)>(x.a-z.a)*(y.b-x.b);}
int main(){
LL i,j,x,F;
node p;
scanf("%lld %lld",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&x);
sum[i]=sum[i-1]+x;
}
s=e=0;
ans=-1;
for(i=1;i<=n;i++){
dp[i]=(sum[i])*(sum[n]-sum[i]);
if(1==k && ans<dp[i] && i!=n){
ans=dp[i];
F=i;
}
p.a=sum[i];
p.b=dp[i]-sum[n]*sum[i];
p.idx=i;
from[1][i]=0;
while(e-s>1 && !is_ok(fc[e-2],fc[e-1],p)) e--;
fc[e++]=p;
}
for(i=2;i<=k;i++){
ns=ne=0;
for(j=1;j<=n;j++) dp[j]=0;
for(j=i;j<=n;j++){
while(e-s>1 && fc[s+1].idx<j && fc[s].a*sum[j]+fc[s].b<=fc[s+1].a*sum[j]+fc[s+1].b) s++;
dp[j]=fc[s].a*sum[j]+fc[s].b-sq(sum[j])+sum[n]*sum[j];
if(i==k && ans<dp[j] && j!=n){
ans=dp[j];
F=j;
}
from[i][j]=fc[s].idx;
p.a=sum[j];
p.b=dp[j]-sum[n]*sum[j];
p.idx=j;
while(ne-ns>1 && !is_ok(nfc[ne-2],nfc[ne-1],p)) ne--;
nfc[ne++]=p;
}
s=ns;
e=ne;
for(j=ns;j<ne;j++) fc[j]=nfc[j];
}
while(F){
anss[ansn++]=F;
F=from[k--][F];
}
printf("%lld\n",ans);
for(i=ansn-1;i>=0;i--) printf("%lld ",anss[i]);
printf("\n");
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld",&n,&k);
~~~~~^~~~~~~~~~~~~~~~~~~
sequence.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&x);
~~~~~^~~~~~~~~~~
sequence.cpp:59:16: warning: 'F' may be used uninitialized in this function [-Wmaybe-uninitialized]
F=from[k--][F];
~~~~~~~~~~~^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
408 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
584 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
644 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
644 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
644 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
892 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
3 ms |
892 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
892 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
892 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1664 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1664 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1664 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1664 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1664 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1664 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
1664 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1664 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1664 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1664 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2348 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2348 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
2348 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
2348 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
2348 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2476 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
2476 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2476 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2476 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2476 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
45 ms |
9900 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
9900 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
38 ms |
9900 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
33 ms |
9900 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
46 ms |
9900 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
33 ms |
9900 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
37 ms |
9900 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
48 ms |
9900 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
9900 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
21 ms |
9900 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
421 ms |
85204 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
28 ms |
85204 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
618 ms |
85204 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
381 ms |
85204 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
438 ms |
85204 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
336 ms |
85204 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
356 ms |
85204 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
408 ms |
85204 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
