제출 #213225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
213225		someone_aa	수열 (APIO14_sequence)	C++17	28 / 100	183 ms	3832 KiB

sequence

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const ll inf = 1e10;
const int maxn = 1100;
ll arr[maxn], pref[maxn];
ll dp[maxn][210], n, k;
ll parent[maxn][210];

ll getsum(int l, int r) {
	if(r < l) return 0;
	return pref[r] - pref[l-1];
}

int main() {
	cin>>n>>k;
	for(int i=1;i<=n;i++) {
		cin>>arr[i];
		pref[i] = pref[i-1] + arr[i];
	}

	for(int i=1;i<n;i++) {
		dp[i][1] = pref[i] * getsum(i+1, n);
	}

	ll result = -inf;
	int resultind = -1;
	for(int d=2;d<=k;d++) {
		for(int i=d;i<=n;i++) {
			dp[i][d] = -inf;
			for(int j=d-1;j<i;j++) {
				if(dp[j][d-1] + getsum(j+1, i) * getsum(i+1, n) >= dp[i][d]) {
					dp[i][d] = dp[j][d-1] + getsum(j+1, i) * getsum(i+1, n);
					parent[i][d] = j;
				}
			}
			if(dp[i][d] >= result) {
				result = dp[i][d];
				resultind = i;
			}
		}
	}
	vector<int>v;
	cout<<result<<"\n";
	for(int i=k;i>=1;i--) {
		v.pb(resultind);
		resultind = parent[resultind][i];
	}
	reverse(v.begin(), v.end());
	for(int i:v) 
		cout<<i<<" ";
	cout<<"\n";
}

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