Submission #59061

#	Time	Username	Problem	Language	Result	Execution time	Memory
59061		zubec	Split the sequence (APIO14_sequence)	C++14	0 / 100	6 ms	2336 KiB

sequence

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

ll n, m, a[1100], pref[1100], dp[1100][210];

void rec(int n, int m){
    if (m == 0)
        return;
    for (int i = n; i >= 1; i--){
        if (dp[i][m-1] + (pref[n]-pref[i])*pref[i] == dp[n][m]){
            rec(i, m-1);
            cout << i << ' ';
            return;
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        pref[i] = pref[i-1] + a[i];
    }
    for (int i = 0; i <= n; i++){
        for (int j = 0; j <= m; j++)
            dp[i][j] = -1e15;
    }
    dp[1][0] = 0;
    for (int ii = 1; ii <= m; ii++){
        for (int i = 1; i <= n; i++){
            for (int j = i; j >= 1; j--){
                dp[i][ii] = max(dp[i][ii], dp[j][ii-1] + (pref[i]-pref[j])*(pref[j]) );
            }
        }
    }
    cout << dp[n][m] << endl;
    rec(n, m);

}

/**

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