제출 #1269428

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1269428		rayan_bd	수열 (APIO14_sequence)	C++20	50 / 100	2095 ms	33096 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define int long long
const long long NEG_INF = -4e18;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    int n, K;
    cin >> n >> K;
    vector<int> ar(n + 1), pref(n + 1);
    for(int i = 1; i <= n; ++i){
        cin >> ar[i];
        pref[i] = pref[i - 1] + ar[i];
    }
    auto query = [&](int l, int r){
        if(r < l) return 0LL;
        return pref[r] - pref[l - 1];
    };

    vector<vector<int>> dp(n + 5, vector<int> (K + 5, NEG_INF));
    vector<vector<int>> choice(n + 5, vector<int>(K + 5, -1));

    for (int i = 1; i <= n+1; i++) dp[i][0] = 0;

    for (int k = 1; k <= K; k++) {
        for (int i = n; i >= 1; i--) {
            for (int j = i; j < n; j++) {
                long long val = query(i,j) * query(j+1,n) + dp[j+1][k-1];
                if (val > dp[i][k]) {
                    dp[i][k] = val;
                    choice[i][k] = j;
                }
            }
        }
    }

    cout << dp[1][K] << "\n";

    vector<int> cuts;
    int i = 1, k = K;
    while (k > 0 && i <= n) {
        int j = choice[i][k];
        if (j == -1) break;
        cuts.push_back(j);
        i = j + 1;
        k--;
    }

    for (int x : cuts) cout << x << " ";
    cout << "\n";

    return 0;
}

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