Submission #735659

#	Time	Username	Problem	Language	Result	Execution time	Memory
735659		Desh03	Split the sequence (APIO14_sequence)	C++17	50 / 100	2098 ms	48312 KiB

sequence

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

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n + 1), pre(n + 1);
    vector<vector<int>> dp(n + 1, vector<int> (k + 1));
    vector<vector<pair<int, int>>> par(n + 1, vector<pair<int, int>> (k + 1));
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++)
        pre[i] = pre[i - 1] + a[i];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= k; j++)
            for (int l = j; l < i; l++)
                if (dp[i][j] <= dp[l][j - 1] + pre[l] * pre[i] - pre[l] * pre[l])
                    dp[i][j] = dp[l][j - 1] + pre[l] * pre[i] - pre[l] * pre[l], par[i][j] = {l, j - 1};
    cout << dp[n][k] << '\n';
    int x = n, y = k;
    while (par[x][y].first) {
        auto [x2, y2] = par[x][y];
        cout << x2 << ' ';
        x = x2, y = y2;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}

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