제출 #477483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
477483		PiejanVDC	Split the sequence (APIO14_sequence)	C++17	0 / 100	2100 ms	16008 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
 
signed main() {
    int n,k; cin>>n>>k;
    vector<int>pref(n+1);
    pref[0]=0;
    for(int i = 0 ; i < n ; i++) {
        int x; cin>>x;
        pref[i+1] = pref[i] + x;
    }
    int res[n+1][k+1];
    int dp[n+1][k+1];
    for(int i = 0 ; i <= n ; i++)
        dp[i][0] = 0;
    for(int i = 1 ; i <= k ; i++)
        dp[0][i] = 0;
    for(int i = 1 ; i <= k ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            dp[j][i] = 0;
            for(int c = 1 ; c < j ; c++) {
                if(dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]) > dp[j][i]) {
                    res[j][i] = c;
                }
                dp[j][i] = max(dp[j][i],dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]));
            }
        }
    }
    int mx=0;
    vector<int>ans;
    int node;
    for(int i = 0 ; i <= n ; i++) {
        if(dp[i][k] > mx) {
            mx=dp[i][k];
            node = i;
        }
    }
    cout << mx << "\n";
    for(int i = 0 ; i < k ; i++) {
        assert(node > 0);
        ans.push_back(node);
        node = res[node][k - i];
    }
    for(int i = 0 ; i < k ; i++)
        cout << ans[i]-1 << " ";
}

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