제출 #433148

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433148		ngrace	수열 (APIO14_sequence)	C++14	39 / 100	2083 ms	24188 KiB

sequence

#include <vector>
#include <iostream>
#include <utility>
#include <deque>
using namespace std;
#define v vector
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long

int main(){
    int N,K;
    cin>>N>>K;
    v<ll> vals(N);
    for(int i=0;i<N;i++) cin>>vals[i];
    if(N==1 || K==0){
        cout<<0<<endl;
        return 0;
    }
    v<ll> prefix;
    prefix.push_back(vals[0]);
    for(int i=1;i<N;i++) prefix.push_back(prefix.back() + vals[i]);

    v<v<int>> from(K+2,v<int>(N+2,-1));
    v<v<ll>> dp(K+2,v<ll>(N+2,0));
    for(int k=1;k<=K;k++){
        for(int i=k-1;i<N-1;i++){
            ll val=0;
            int ind=0;
            for(int j=k-1;j<=i;j++){
                if(j==0){
                    ll tmp=prefix[i] * (prefix[N-1]-prefix[i]);
                    val=max(val,tmp);
                    if(val==tmp) ind=j-1;
                    continue;
                }
                ll tmp=prefix[i] * (prefix[N-1]-prefix[i]);
                tmp+=prefix[j-1]*prefix[i];
                tmp+=dp[k-1][j-1] - prefix[N-1] * prefix[j-1];
                val=max(val, tmp);
                if(val==tmp) ind=j-1;
            }
            dp[k][i]=val;
            from[k][i]=ind;
        }
    }

    ll out=0;
    int ind=0;
    for(int i=0;i<N;i++){
        out=max(out, dp[K][i]);
        if(out==dp[K][i]) ind=i;
    }
    cout<<out<<endl;
    for(int k=K;k>0;k--){
        cout<<ind+1<<" ";
        ind=from[k][ind];
    }
    cout<<endl;
}

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