제출 #997474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
997474		vjudge1	수열 (APIO14_sequence)	C++17	71 / 100	2015 ms	116560 KiB

sequence

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll N = 1e5 + 100;
const ll K = 205;

ll n, k, a[N], dp[N][K], par[N][K], suff[N];

int main(){
    cin >> n >> k;
    k++;

    for (ll i = 1; i <= n; i ++)
        cin >> a[i];
    for (ll i = n; i > 0; i --)
        suff[i] = suff[i + 1] + a[i];

    for (ll i = n; i > 0; i --){
        for (ll p = 2; p <= k; p ++){
            if (i + p - 1 > n){
                dp[i][p] = -1e18;
                continue;
            }
            dp[i][p] = -1;

            if (p == 2){
                ll poss = n;
                int bad = 0;
                for (ll j = poss; j > i; j --){
                    ll val = dp[j][p - 1] + (suff[i] - suff[j]) * suff[j];
                    if (val > dp[i][p]){
                        dp[i][p] = val;
                        par[i][p] = j;
                    }
                }
            }
            else{
                int bad = 0;
                for (ll j = par[i][p - 1]; j > i; j --){
                    ll val = dp[j][p - 1] + (suff[i] - suff[j]) * suff[j];
                    if (val > dp[i][p]){
                        dp[i][p] = val;
                        par[i][p] = j;
                    }
                }
            }

            // cout << i << " " << p << " goes to " << par[i][p] << endl;
        }
    }

    cout << dp[1][k] << endl;

    ll cur_i = 1;
    ll cur_k = k;

    while (cur_k > 1){
        cout << par[cur_i][cur_k] - 1 << " ";
        cur_i = par[cur_i][cur_k];
        cur_k--;
    }
    cout << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'int main()':
sequence.cpp:30:21: warning: unused variable 'bad' [-Wunused-variable]
   30 |                 int bad = 0;
      |                     ^~~
sequence.cpp:40:21: warning: unused variable 'bad' [-Wunused-variable]
   40 |                 int bad = 0;
      |                     ^~~

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