Submission #18609

#	Time	Username	Problem	Language	Result	Execution time	Memory
18609		eaststar	Split the sequence (APIO14_sequence)	C++14	33 / 100	4 ms	100716 KiB

sequence

#include <stdio.h>
int q[100010],p[210][100010];
long long a[100010],D[210][10010];
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[0][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[i-1][q[f]]<=a[q[f+1]]*a[j]+D[i-1][q[f+1]])++f;
            D[i][j]=a[q[f]]*a[j]+D[i-1][q[f]]-a[j]*a[j],p[i][j]=q[f];
            while(f<r&&(D[i-1][q[r]]-D[i-1][q[r-1]])*(a[q[r-1]]-a[j])>(D[i-1][j]-D[i-1][q[r-1]])*(a[q[r-1]]-a[q[r]]))--r;
            q[++r]=j;
        }
    }
    printf("%lld\n",D[k][n]+a[n]*a[n]);
    path(k-1,p[k][n]);
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29