제출 #122541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122541		jakob_nogler	수열 (APIO14_sequence)	C++14	0 / 100	154 ms	131072 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 100005, K = 205;

ll dp[K][N], sum[N], val[N], m[N], q[N], tot = 0;
int nxt[K][N];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k;
    cin >> n >> k;

    for(int i = 0; i < n; i++){
        cin >> val[i];
        tot += val[i];
        sum[i] += val[i];
        sum[i + 1] += sum[i];
    }

    for(int i = 0; i < n; i++)
        m[i] = tot - (i == 0 ? 0 : sum[i - 1]);

    for(int i = 1; i <= k; i++){
        int idx = n - 1;
        for(int j = n - 1; j >= 0; j--){
            ll curr = m[j];
            while(idx - 1 > j && m[idx - 1] * curr + q[idx - 1] >= m[idx] * curr + q[idx]) idx--;

            nxt[i][j] = idx;
            dp[i][j] = m[idx] * curr + q[idx];
            q[j] = dp[i - 1][j] - m[j] * (tot - sum[j - 1]);
        }
    }

    cout << dp[k][0] << endl;
    int curr = nxt[k][0];
    for(int i = k - 1; i >= 0; i--){
        cout << curr << " ";
        curr = nxt[i][curr];
    }
    cout << endl;
}

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