제출 #633515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633515		tvladm2009	수열 (APIO14_sequence)	C++14	71 / 100	92 ms	31968 KiB

sequence

#include <iostream>
#define int long long

using namespace std;

const int MAX_N = 1e4;
const int MAX_K = 200;
const int INF = (1LL << 60);
int a[MAX_N + 1], sp[MAX_N + 1], dp[MAX_N + 1][MAX_K + 1];
int sol[MAX_N + 1][MAX_K + 1];
int n, k;

void divide(int k, int l, int r, int p, int q) {
    if (p > q) {
        return;
    }
    int mid = (p + q) / 2;
    dp[mid][k] = -INF;
    int best = 0;
    for (int i = l; i <= min(mid, r); i++) {
        int kek = (sp[mid] - sp[i - 1]) * (sp[n] - sp[mid]);
        if (dp[i - 1][k - 1] + kek >= dp[mid][k]) {
            dp[mid][k] = dp[i - 1][k - 1] + kek;
            best = i;
        }
    }
    sol[mid][k] = best - 1;
    divide(k, l, best, p, mid - 1);
    divide(k, best, r, mid + 1, q);
}

signed main() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sp[i] = sp[i - 1] + a[i];
    }
    k++;
    for (int i = 1; i <= n; i++) {
        dp[i][1] = sp[i] * (sp[n] - sp[i]);
    }
    for (int i = 2; i <= k; i++) {
        divide(i, 1, n, 1, n);
    }
    cout << dp[n][k] << "\n";
    int aux = n;
    for (int i = k; i >= 2; i--) {
        cout << sol[aux][i] << " ";
        aux = sol[aux][i];
    }
    return 0;
}

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