제출 #660341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660341		leroycut	수열 (APIO14_sequence)	C++17	33 / 100	2080 ms	3680 KiB

sequence

#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ld = long double;
 
const int N = 1e5 + 3;
const ll INF = 2e12 + 3;

int n, k;
ll dp[N][203], p[N];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    cin >> n >> k;
    for(int i = 1; i <= n; ++i){
        ll a;
        cin >> a;
        p[i] = p[i - 1] + a;
    }

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j < i; ++j){
            for(int t = 1; t < i; ++t){
                dp[i][j] = max(dp[i][j], dp[t][j - 1] + p[t] * (p[i] - p[t]));
            }
        }
    }

    ll cur = dp[n][k];
    cout << cur << "\n";
    int poi = n - 1, end = n, cnt = k - 1;
    for(; poi >= 1 && cnt >= 0; --poi){
        if(dp[poi][cnt] + p[poi] * (p[end] - p[poi]) == dp[end][cnt + 1]){
            cout << poi << " ";
            end = poi;
            cnt--;
        }
    }
}

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