#include<stdio.h>
int n,k,top,p,path[210][100010],w,dap[100010];
long long int a[100010],s[100010],d[2][100010];
struct data
{
long long int m,n,pos;
}st[100010];
int main()
{
long long int i,j,r,m1,m2,n1,n2,m3,n3;
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
s[i]=s[i-1]+a[i];
}
for(i=2;i<=k+1;i++)
{
top=1, p=1;
st[1].m=s[i-1]; st[1].n=-s[i-1]*s[i-1]+d[(i+1)%2][i-1]; st[1].pos=i-1;
for(j=i;j<=n;j++)
{
m2=s[j]; n2=-s[j]*s[j]+d[(i+1)%2][j];
if(p>top) p=top;
for(r=p;r<=top-1;r++)
{
m1=st[r+1].m; n1=st[r+1].n; m3=st[r].m; n3=st[r].n;
if(n3-n1>=(m1-m3)*s[j]) break;
}
p=r;
d[i%2][j]=st[p].m*s[j]+st[p].n; path[i][j]=st[p].pos;
for(r=top;r>=1;r--)
{
if(r==1) break;
m1=st[r].m; n1=st[r].n; m3=st[r-1].m; n3=st[r-1].n;
if((n1-n2)*(m1-m3)>(m2-m1)*(n3-n1)) break;
}
top=r;
top++; st[top].m=m2; st[top].n=n2; st[top].pos=j;
}
}
printf("%lld\n",d[(k+1)%2][n]);
p=n;
for(i=k+1;i>=1;i--)
{
dap[++w]=p;
p=path[i][p];
}
for(i=w;i>=2;i--) printf("%d ",dap[i]);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
28 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
24 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
20 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
24 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
36 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
16 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
320 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
564 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
316 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
384 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
256 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
272 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
316 ms |
88988 KB |
Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
