제출 #997416

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
997416		vjudge1	Split the sequence (APIO14_sequence)	C++17	39 / 100	77 ms	3676 KiB

sequence

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

typedef long long ll;

const ll N = 1e3 + 100;
const ll K = 205;

ll n, k, a[N], dp[N][K], par[N][K], suff[N];

int main(){
    cin >> n >> k;
    k++;

    for (ll i = 1; i <= n; i ++)
        cin >> a[i];
    for (ll i = n; i > 0; i --)
        suff[i] = suff[i + 1] + a[i];

    for (ll p = 2; p <= k; p ++){
        for (ll i = n - p + 1; i > 0; i --){
            for (ll j = i + 1; j <= n - p + 2; j ++){
                ll nval = dp[j][p - 1] + (suff[i] - suff[j]) * suff[j];
                // cout << i << " " << p << " goes to " << j << " and val = " << nval << endl;

                if (nval > dp[i][p])
                    par[i][p] = j;

                dp[i][p] = max(dp[i][p], nval);
            }
        }
    }

    cout << dp[1][k] << endl;

    int cur_i = 1;
    int cur_k = k;

    while (cur_k > 1){
        cout << par[cur_i][cur_k] - 1 << " ";
        cur_i = par[cur_i][cur_k];
        cur_k--;
    }
    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