제출 #365138

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

sequence

#include <bits/stdc++.h>
 
 
using namespace std;
 
 
const int MAXN = 100 * 1000 + 2, MAXK = 200 + 2;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
int n, k, chi, lvl;
int par[MAXK][MAXN];
long long dp[2 + 2][MAXN], ps[MAXN];
 
void cal(int l = chi, int r = n + 1, int ll = chi, int rr = n) {
	int mid = ((l + r) >> 1), md = -1;
	for (int i = ll; i < mid && i < r; i++) {
		if (dp[1 - lvl][i] + ps[i] * (ps[mid] - ps[i]) > dp[lvl][mid]) {
			dp[lvl][mid] = dp[1 - lvl][i] + ps[i] * (ps[mid] - ps[i]);
			md = i;
		}
	}
	par[chi][mid] = md;
	if (l < mid) cal(l, mid, ll, md);
	if (mid + 1 < r) cal(mid + 1, r, md, rr);
}
 
 
 
int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	cin >> n >> k;
	int a;
	for (int i = 0; i < n; i++) {
		cin >> a;
		ps[i + 1] = ps[i] + a;
	}
	for (int i = 1; i <= k; i++) {
		chi = i;
		lvl = i & 1;
		for (int j = i; j <= n; j++) dp[lvl][j] = -1;
		cal();
	}
	cout << dp[k & 1][n] << '\n';
	while (k > 0) {
		cout << par[k][n] << ' ';
		n = par[k][n];
		k--;
	}
	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