Submission #7083

#	Time	Username	Problem	Language	Result	Execution time	Memory
7083		baneling100	Split the sequence (APIO14_sequence)	C++98	22 / 100	0 ms	82340 KiB

sequence

#include <stdio.h>

int N, K, Path[201][100001], S[100001], Top, Ans[201];
unsigned long long A[100001], D[2][100001];

void input(void)
{
    int i;

    scanf("%d %d",&N,&K);
    for(i=1 ; i<=N ; i++)
    {
        scanf("%llu",&A[i]);
        A[i]+=A[i-1];
    }
}

void process(void)
{
    int i, j, k, x, now;
    unsigned long long a, b, c, d, e, f;

    for(j=1 ; j<=K ; j++)
    {
        x=j%2;
        Top=0;
        now=1;
        for(k=j ; k<=N ; k++)
        {
            if(Top<2)
                S[++Top]=k;
            else
            {
                a=A[S[Top-1]];
                b=D[1-x][S[Top-1]]-A[S[Top-1]]*A[S[Top-1]];
                c=A[S[Top]];
                d=D[1-x][S[Top]]-A[S[Top]]*A[S[Top]];
                e=A[k];
                f=D[1-x][k]-A[k]*A[k];
                while((d-b)*(e-a)<=(c-a)*(f-b) && Top>=2)
                {
                    Top--;
                    a=A[S[Top-1]];
                    b=D[1-x][S[Top-1]]-A[S[Top-1]]*A[S[Top-1]];
                    c=A[S[Top]];
                    d=D[1-x][S[Top]]-A[S[Top]]*A[S[Top]];
                }
                S[++Top]=k;
            }
            a=A[S[now]]*A[k+1]+D[1-x][S[now]]-A[S[now]]*A[S[now]];
            b=A[S[now+1]]*A[k+1]+D[1-x][S[now+1]]-A[S[now+1]]*A[S[now+1]];
            while(now<k && a<b)
            {
                now++;
                a=A[S[now]]*A[k+1]+D[1-x][S[now]]-A[S[now]]*A[S[now]];
                b=A[S[now+1]]*A[k+1]+D[1-x][S[now+1]]-A[S[now+1]]*A[S[now+1]];
            }
            D[x][k+1]=a;
            Path[j][k+1]=S[now];
        }
    }
    a=K;
    b=N;
    while(a)
    {
        Ans[a]=Path[a][b];
        b=Path[a][b];
        a--;
    }
}

void output(void)
{
    int i;

    printf("%llu\n",D[K%2][N]);
    for(i=1 ; i<=K ; i++)
        printf("%d ",Ans[i]);

}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

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