# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
394789 | Anand | Split the sequence (APIO14_sequence) | C++14 | 515 ms | 81704 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int q[100010],p[210][100010];
long long a[100010],D[100010],E[100010];
void path(int k,int n){
if(k<0)return;
path(k-1,p[k][n]);
printf("%d ",n);
}
int main(){
int i,j,n,k,f,r;
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)scanf("%lld",a+i),a[i]+=a[i-1],D[i]=-a[i]*a[i];
for(i=1;i<=k;++i){
q[f=r=1]=i;
for(j=i+1;j<=n;++j){
while(f<r&&a[q[f]]*a[j]+D[q[f]]<=a[q[f+1]]*a[j]+D[q[f+1]])++f;
E[j]=a[q[f]]*a[j]+D[q[f]]-a[j]*a[j],p[i][j]=q[f];
while(f<r&&(D[q[r]]-D[q[r-1]])*(a[q[r-1]]-a[j])>=(D[j]-D[q[r-1]])*(a[q[r-1]]-a[q[r]]))--r;
q[++r]=j;
}
for(j=i+1;j<=n;++j)D[j]=E[j];
}
printf("%lld\n",D[n]+a[n]*a[n]);
path(k-1,p[k][n]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |