제출 #101647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101647		KCSC	수열 (APIO14_sequence)	C++14	78 / 100	1474 ms	81532 KiB

sequence

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

const int KMAX = 205;
const int NMAX = 100005;

long long dp[2][NMAX], psm[NMAX];
int fth[KMAX][NMAX];

void divide(int p, int le, int ri, int st, int en) {
	if (le > ri) {
		return; }
	int md = (le + ri) / 2, l = p & 1; 
	dp[l][md] = -1;
	for (int i = st; i <= md - 1 and i <= en; ++i) {
		if (dp[l][md] < dp[l ^ 1][i] + psm[i] * (psm[md] - psm[i])) {
			dp[l][md] = dp[l ^ 1][i] + psm[i] * (psm[md] - psm[i]); 
			fth[p][md] = i; } }
	divide(p, le, md - 1, st, fth[p][md]);
	divide(p, md + 1, ri, fth[p][md], en); }

int main(void) {
#ifdef HOME
	freopen("sequence.in", "r", stdin);
	freopen("sequence.out", "w", stdout);
#endif
	int n, k; cin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		cin >> psm[i]; psm[i] += psm[i - 1]; }
	for (int i = 1; i <= k; ++i) {
		divide(i, i, n, i - 1, n - 1); }
	cout << dp[k & 1][n] << endl;
	for (int i = k, j = n; i >= 1; --i) {
		cout << fth[i][j] << " "; j = fth[i][j]; }
	return 0; }

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