Submission #304413

#	Time	Username	Problem	Language	Result	Execution time	Memory
304413		vipghn2003	Split the sequence (APIO14_sequence)	C++14	0 / 100	24 ms	4224 KiB

sequence

#include<bits/stdc++.h>

using namespace std;

const int N=1e5+5;
const int K=205;
int n,k,a[N],s[N],dp[K][N],opt[K][N];

void calc(int lev,int l,int r,int L,int R)
{
    if(l>r) return ;
    int mid=(l+r)/2;
    dp[lev][mid]=1e9;
    for(int i=L;i<=min(mid-1,R);i++)
    {
        if(dp[lev][mid]>dp[lev-1][i]+(s[mid]-s[i])*(s[mid]-s[i]))
        {
            dp[lev][mid]=dp[lev-1][i]+(s[mid]-s[i])*(s[mid]-s[i]);
            opt[lev][mid]=i;
        }
    }
    calc(lev,l,mid-1,L,opt[lev][mid]);
    calc(lev,mid+1,r,opt[lev][mid],R);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>k;
    k++;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        s[i]=s[i-1]+a[i];
    }
    int res=s[n]*s[n];
    dp[1][0]=1e9;
    for(int i=1;i<=n;i++)
    {
        dp[1][i]=s[i]*s[i];
        opt[1][i]=i;
    }
    for(int lev=2;lev<=k;lev++) calc(lev,1,n,0,n-1);
    res-=dp[k][n];
    cout<<res/2<<'\n';
    int cur=n;
    while(k>1)
    {
        cur=opt[k][cur];
        k--;
        cout<<cur<<' ';
    }
}

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