제출 #742159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
742159		viwlesxq	수열 (APIO14_sequence)	C++17	78 / 100	1533 ms	82704 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;
typedef string str;

const int N = 1e5 + 1, K = 201;

int n, k;
ll a[N], pref[N];
vector <ll> dp_old(N), dp_new(N);
int p[N][K], v;

ll get(int l, int r) {
    return (pref[r] - pref[l - 1]) * (pref[n] - pref[r]); 
}

void solve(int l, int r, int opt_l, int opt_r) {
    if (l > r) {
        return;
    }
    int mid = (l + r) >> 1;
    pair <ll, int> best = {0, -1};
    for (int i = opt_l; i <= min(mid, opt_r); ++i) {
        best = max(best, {dp_old[i] + get(i + 1, mid), i});
    }
    p[mid][v] = best.second;
    dp_new[mid] = best.first;
    int opt = best.second;
    solve(l, mid - 1, opt_l, opt);
    solve(mid + 1, r, opt, opt_r);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> k;
    pref[0] = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }
    for (int i = 1; i <= n; ++i) {
        dp_old[i] = get(1, i);
    }
    for (int i = 2; i <= k; ++i) {
        v = i;
        solve(i, n, 1, n);
        dp_old = dp_new;
    }
    ll ans = -1, j = -1;
    for (int i = 1; i <= n; ++i) {
        if (dp_new[i] > ans) {
            ans = dp_new[i];
            j = i;
        }
    }
    vector <int> arr;
    v = k;
    while (v) {
        arr.push_back(j);
        j = p[j][v];
        v--;
    }
    reverse(arr.begin(), arr.end());
    cout << ans << '\n';
    for (int i : arr) {
        cout << i << ' ';
    }
}

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