#include<stdio.h>
#define sq(a) ((a)*(a))
#define sik(l,x) (-(l.a)*(x)+(l.b))
typedef long long lld;
struct lin {
int ix;
lld a, b; // -ax+b
}stk[100100], im;
int n, k, di[100100][202], scn;
lld ba[100100], dy[100100][2];
int main(){
int i, i2, j, t=1;
scanf("%d%d", &n, &k);
for(i=1; i<=n; i++){
scanf("%lld", &ba[i]), ba[i]+=ba[i-1];
dy[i][0]=sq(ba[i]);
}
for(j=1; j<=k; j++){
im.a=2*ba[j], im.b=dy[j][1-t]+sq(ba[j]), im.ix=j;
stk[0]=im, scn=1;
for(i=1; i<=j; i++)dy[i][t]=0;
for(i=j+1, i2=0; i<=n; i++){
for(; i2<scn-1; i2++){
if(sik(stk[i2],ba[i])<sik(stk[i2+1],ba[i]))break;
}
di[i][j]=stk[i2].ix, dy[i][t]=sq(ba[i])+sik(stk[i2],ba[i]);
im.ix=i, im.a=2*ba[i], im.b=dy[i][1-t]+sq(ba[i]);
for(; scn; scn--){
if(stk[scn-1].b>=im.b)continue;
if((stk[scn-1].b-stk[scn-2].b)*(im.a-stk[scn-2].a)<(im.b-stk[scn-2].b)*(stk[scn-1].a-stk[scn-2].a))break;
}
stk[scn++]=im;
if(i2>=scn)i2=scn-1;
}
t=1-t;
}
printf("%lld\n", (sq(ba[n])-dy[n][1-t])/2);
for(i=n, j=k; j>0; j--)printf("%d ", di[i][j]), i=di[i][j];
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
56 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
36 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
40 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
36 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
32 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
36 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
52 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
564 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
28 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
604 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
412 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
456 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
352 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
392 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
504 ms |
84764 KB |
Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
