#include<stdio.h>
int dat[100001], s[100001];
long long dp[2][100001];
long long Y[100001];
int p[210][100001];
int stk[100001], b;
inline bool cmp(long long *D, int z)
{
int x, y;
x = stk[b-1];
y = stk[b];
return (Y[y]-Y[x])*(s[y]-s[z]) >= (Y[z]-Y[y]) *(s[x]-s[y]);
}
int main()
{
int n, k;
int i, j, l;
scanf("%d%d", &n, &k); k++;
for(i=1; i<=n; i++)
{
scanf("%d", &dat[i]);
s[i] = s[i-1] + dat[i];
}
for(i=0; i<=1; i++)for(j=0; j<=n; j++) dp[i][j]=-1;
for(j=0; j<=n; j++)
{
dp[1][j] = 0;
}
for(i=2; i<=k; i++)
{
for(j=0; j<=n; j++) dp[i%2][j]=0;
long long *D = dp[(i-1)%2];
b = -1;
int x=1;
stk[++b] = 0; stk[++b] = 1;
for(j=0; j<=n; j++) Y[j] = D[j] - 1ll*s[j]*s[j];
for(l=2; l<=n; l++)
{
if(x>b) x = b;
while(x < b && (Y[stk[x]] - Y[stk[x+1]]) <= 1ll*(s[stk[x+1]] - s[stk[x]])*s[l] ) x++;
dp[i%2][l] = Y[stk[x]] + 1ll*s[stk[x]]*s[l];
p[i][l] = stk[x];
while( b>=x && cmp(D, l) ) b--;
stk[++b] = l;
}
}
printf("%lld\n", dp[k%2][n]);
int x = n;
for(int i=k; i>1; i--)
{
x = p[i][x];
printf("%d ", x);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
4 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
36 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
24 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
32 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
24 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
28 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
344 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
580 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
360 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
416 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
272 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
288 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
372 ms |
86636 KB |
Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
