Submission #50822

#	Time	Username	Problem	Language	Result	Execution time	Memory
50822		edisonhello	Split the sequence (APIO14_sequence)	C++11	71 / 100	2039 ms	26748 KiB

sequence

#include<cstdio>
#include<stack>
#include<climits>
#include<cstring>
using namespace std;
#define ll long long

int n,k;
ll a[100005],pre[100005],dp[205][100005];
int tp[205][100005];

#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
// #define fread fread_unlocked
// #define fwrite fwrite_unlocked
inline char gtx(){
    const int N=4096;
    static char buffer[N];
    static char *p=buffer,*end=buffer;
    if(p==end){
        if((end=buffer+fread(buffer,1,N,stdin))==buffer)return EOF;
        p=buffer;
    } return *p++;
}

template<typename T>
inline bool rit(T &x){
    char c=0; bool fg=0;
    while(c=gtx(), (c<'0' && c!='-') || c>'9')if(c==EOF)return false;
    c=='-' ? (fg=1,x=0) : (x=c&15);
    while(c=gtx(), c>='0' && c<='9')x=x*10+(c&15);
    if(fg)x=-x; return true;
}
template<typename T,typename ...Args>
inline bool rit(T& x,Args& ...args){return rit(x)&&rit(args...);}

struct outputter{
    char buffer[4112],*ptr=buffer,*end=buffer+4096;
    template<typename T>inline void write(T x,char endc='\n'){
        if(x<0)*ptr='-',++ptr,x=-x; if(!x)*ptr='0',++ptr;
        char *s=ptr,c; T t;
        while(x){t=x/10; c=x-10*t+'0'; *ptr=c,++ptr,x=t;}
        char *f=ptr-1; while(s<f)swap(*s,*f),++s,--f;
        if(ptr>end)fwrite(buffer,sizeof(char),ptr-buffer,stdout),ptr=buffer;
        *ptr=endc,++ptr;
    }

    template<typename T>
    inline void output(T x){ write(x,'\n'); }
    template<typename T,typename ...Args>
    inline void output(T x,Args ...args){ write(x,' '); output(args...); }

    template<typename ...Args> inline void operator()(Args ...args){ output(args...); }
    outputter(){}
    ~outputter(){ fwrite(buffer,sizeof(char),ptr-buffer,stdout); }
} pit;
#pragma GCC diagnostic pop

int main(){
    rit(n,k);
    for(int i=1;i<=n;++i)rit(a[i]);
    for(int i=1;i<=n;++i)pre[i]=pre[i-1]+a[i];
    memset(dp+1,0xb0,100004<<3);
    for(int j=1;j<=n;++j)tp[0][j]=1;
    for(int i=1;i<=k;++i){
        tp[i][n+1]=n;
        for(int j=n;j>=i;--j){
            ll mx=LLONG_MIN,val;
            int p=-1;
            for(int k=tp[i-1][j];k<=tp[i][j+1];++k){
                val=(pre[n]-pre[j])*(pre[j]-pre[k-1])+dp[i-1][k-1];
                if(val>mx){
                    mx=val;
                    p=k;
                }
            }
            tp[i][j]=p;
            dp[i][j]=mx;
        }
    }
    ll mx=LLONG_MIN;
    int p=-1;
    for(int i=k;i<=n;++i){
        if(dp[k][i]>mx){
            mx=dp[k][i];
            p=i;
        }
    }
    pit(mx);
    int zi=k,zj=p;
    stack<int> ans;
    while(zi){
        ans.push(zj);
        zj=tp[zi][zj]-1;
        --zi;
    }
    while(ans.size()){
        pit.write(ans.top(),' ');
        ans.pop();
    }
    /* for(int i=1;i<=k;++i){
        for(int j=1;j<=n;++j){
            cout<<tp[i][j]<<" ";
        }
        cout<<endl;
    } */
}

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