#include<cstdio>
long long a[100001];
long long d[2][100001];
long long *now, *next;
int v[201][100001];
void dfs(int p,int s,int e,int f,int r)
{
if(s<=e)
{
int i,t=(s+e)/2;
next[t]=9e18;
for(i=f;i<=t&&i<=r;i++)if(next[t]>now[i]+(a[t]-a[i])*(a[t]-a[i]))
{
next[t]=now[i]+(a[t]-a[i])*(a[t]-a[i]);
v[p][t]=i;
}
dfs(p,s,t-1,f,v[p][t]);
dfs(p,t+1,e,v[p][t],r);
}
}
void print(int i,int j)
{
if(i)
{
print(i-1,v[i][j]);
printf("%d ",v[i][j]);
}
}
int main()
{
long long *temp;
int i,n,m;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
a[i]+=a[i-1];
}
now=d[0];
next=d[1];
for(i=1;i<=n;i++)now[i]=a[i]*a[i];
for(i=1;i<=m;i++)
{
dfs(i,1,n,i-1,n);
temp=now;
now=next;
next=temp;
}
printf("%lld\n",(a[n]*a[n]-now[n])/2);
print(m,n);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
81948 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
81948 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
3 |
Incorrect |
0 ms |
81948 KB |
Output isn't correct - Integer 0 violates the range [1, 1] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |