제출 #1001366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001366		aaaaaarroz	수열 (APIO14_sequence)	C++17	0 / 100	2049 ms	15960 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    ll n, K;
    cin >> n >> K;
    vector<ll> arr(n);
    for(ll &a : arr) cin >> a;
    vector<ll> prefix(n+1, 0);
    for(ll i = 0; i < n; i++) {
        prefix[i+1] = prefix[i] + arr[i];
    }
    vector<vector<ll>> dp(n+1, vector<ll>(K+1, 0));
    vector<vector<ll>> prev(n+1, vector<ll>(K+1, -1));
    for(ll k = 1; k <= K; k++) {
        for(ll i = k; i <= n; i++) {
            for(ll p = 0; p < i; p++) {
                if((dp[p][k-1] + (prefix[i] - prefix[p]) * prefix[p])>dp[i][k]){
                    prev[i][k]=p;
                    dp[i][k] = dp[p][k-1] + (prefix[i] - prefix[p]) * prefix[p];
                }
            }
        }
    }
    vector<ll>splits;
    cout<<dp[n][K]<<"\n";
    ll parent=prev[n][K];
    ll k=K;
    splits.push_back(parent);
    while(prev[parent][k]!=-1){
        k--;
        parent=prev[parent][k];
        splits.push_back(parent);
    }
    reverse(splits.begin(),splits.end());
    for(ll &res:splits){
        cout<<res<<" ";
    }
    return 0;
}

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