Submission #964212

#	Time	Username	Problem	Language	Result	Execution time	Memory
964212		akacool445k	Split the sequence (APIO14_sequence)	C++14	50 / 100	2051 ms	70412 KiB

sequence

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


#define int long long
const int M = 1e5 + 2;
int a[M], pre[M];
int dp[M][201];
int id[M][201];
const int inf = LLONG_MAX / 2;
int sq(int x) {
    return x * x;
}
signed main() {
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        pre[i] = pre[i - 1] + a[i];
    }
    for(int i = 0; i <= k; i++) dp[0][i] = 0;
    for(int i = 1; i <= n; i++) {
        dp[i][1] = sq(pre[i]);
        for(int j = 2; j <= k + 1; j++) {
            dp[i][j] = inf;
            for(int q = 1; q < i; q++) {
                if(dp[i][j] > dp[q][j - 1] + sq(pre[i] - pre[q])) {
                    dp[i][j] = dp[q][j - 1] + sq(pre[i] - pre[q]);
                    id[i][j] = q;
                }
            }
        }    
    }
    cout << (sq(pre[n]) - dp[n][k + 1]) / 2 << '\n';
    int gay = id[n][k + 1];
    k++;
    while(k > 1) {
        cout << gay << ' ';
        k--;
        gay = id[gay][k];
    } 
    cout << '\n';
}

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