제출 #735759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
735759		Desh03	Split the sequence (APIO14_sequence)	C++17	0 / 100	2056 ms	19284 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, -1e15));
    vector<vector<pair<int, int>>> par(n + 1, vector<pair<int, int>> (k + 1));
    vector<vector<tuple<int, int, int, int>>> cht(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 = 0; i <= n; i++)
        for (int j = 0; j < i; j++)
            dp[i][j] = -pre[i] * pre[i];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= min(k, i - 1); j++) {
            int mx = -1e15, xx = 0, yy = 0;
            for (auto [x, y, t, r] : cht[j])
                if (x * pre[i] + y >= mx)
                    mx = x * pre[i] + y, xx = t, yy = r;
            dp[i][j] += mx;
            par[i][j] = {xx, yy};
        }
        for (int j = 1; j <= min(k, i); j++)
            cht[j].push_back({pre[i], dp[i][j - 1], i, j - 1});
    }
    cout << dp[n][k] + pre[n] * pre[n] << '\n';
    int x = n, y = k;
    while (par[x][y].first) {
        auto [x2, y2] = par[x][y];
        x = x2, y = y2;
        cout << x << ' ';
    }
}

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

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