제출 #372289

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

sequence

#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef long long lol;
const ll N = 1e5 + 3, K = 201;
ll par [K][N], n, k, cur, t;
lol dp [2][N], ps [N];
void solve (ll l, ll r, ll optl, ll optr) {
	if (l > r) return;
  	ll m = (l + r) >> 1, till = min(m, optl);
	ll bst = -1; lol mx = -1;
    for (ll i = m; i >= till; i--) {
    	lol p = dp[t][i - 1] + ps[i - 1] * (ps[m] - ps[i - 1]);
    	if (p > mx) mx = p, bst = i; 
    }
    dp[1 - t][m] = mx;
    par[cur][m] = bst - 1;
    solve(l, m - 1, optl, bst);
    solve(m + 1, r, bst, optr);
}
int main ()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin>> n >> k;
    for (ll i = 1; i <= n; i++) cin>> ps[i], ps[i] += ps[i - 1];
    for (cur = 1, t = 0; cur <= k; cur++, t ^= 1) solve(1, n, 1, n);
    cout<< dp[k & 1][n] << '\n';
    cur = n;
    for (ll i = k; i > 0; --i) cur = par[i][cur], cout<< cur << ' ';
    return 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