Submission #983002

#	Time	Username	Problem	Language	Result	Execution time	Memory
983002		Hugo1729	Split the sequence (APIO14_sequence)	C++11	0 / 100	2093 ms	108860 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[100001][202]={0};
ll pref[100001]={0};
ll p[100001][202];

int main(){
    // cin.tie(0)->sync_with_stdio(0);

    int n, k; cin >> n >> k;
    vector<ll> a(n);
    for(int i=0;i<n;i++)cin >> a[i];
    for(int i=0;i<n;i++)pref[i+1]=pref[i]+a[i];

    for(int j=1;j<=k+1;j++){
        for(int i=1;i<=n;i++){   //maak i = 0
            for(int x=0;x<i;x++){
                if(dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i])>=dp[i][j]){
                    dp[i][j]=dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i]);
                    p[i][j]=x;
                }
            }
            // cout << '(' << i << ' ' << j << ')' << dp[i][j] << ' ' << p[i][j] << ' ';
        }
        // cout << '\n';
    }

    cout << dp[n][++k] << '\n';

    int sus=p[n][k--];

    while(sus>0){
        cout << sus << ' ';
        sus=p[sus][k--];
    }

    return 0;
// 7 3
// 4 1 3 4 0 2 3

}

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