#include<bits/stdc++.h>
using namespace std;
long long a[100010],qs[100010],dp[2][100010];
int p[205][100010],n,k;
void play(int st,int l,int r,int optl,int optr){
int mid=(l+r)/2,pos,i;
long long mi=1e18;
if(l>r) return;
for(i=optl;i<=min(mid,optr);i++){
if(dp[1-st%2][i-1]+(qs[mid]-qs[i-1])*(qs[mid]-qs[i-1])<=mi){
mi=dp[1-st%2][i-1]+(qs[mid]-qs[i-1])*(qs[mid]-qs[i-1]);
pos=i;
}
}
dp[st%2][mid]=mi;
p[st][mid]=pos-1;
play(st,l,mid-1,optl,pos);
play(st,mid+1,r,pos,optr);
}
int main(){
int i,j,now;
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&a[i]);
qs[i]=qs[i-1]+a[i];
}
for(i=1;i<=n;i++){
dp[0][i]=qs[i]*qs[i];
}
for(i=1;i<=k;i++){
play(i,1,n,1,n);
}
printf("%lld\n",(qs[n]*qs[n]-dp[k%2][n])/2);
now=n;
for(i=k;i>=1;i--){
printf("%d ",p[i][now]);
now=p[i][now];
}
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:21:11: warning: unused variable 'j' [-Wunused-variable]
21 | int i,j,now;
| ^
sequence.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
22 | scanf("%d %d",&n,&k);
| ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
24 | scanf("%lld",&a[i]);
| ~~~~~^~~~~~~~~~~~~~
sequence.cpp: In function 'void play(int, int, int, int, int)':
sequence.cpp:16:19: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
16 | p[st][mid]=pos-1;
| ~~~^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
6 ms |
1996 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
1996 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
6 ms |
1740 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
8 ms |
1996 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
6 ms |
2004 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
972 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
57 ms |
9488 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
52 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
48 ms |
6852 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
62 ms |
7232 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
44 ms |
6004 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
55 ms |
6808 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
59 ms |
8552 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
4548 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
24 ms |
4588 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
622 ms |
81764 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
24 ms |
4548 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
879 ms |
81672 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
529 ms |
58208 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
660 ms |
62132 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
465 ms |
51128 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
489 ms |
58136 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
608 ms |
73776 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |