제출 #503900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503900		sumit_kk10	수열 (APIO14_sequence)	C++17	50 / 100	2089 ms	31856 KiB

sequence

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define S second
#define F first 
#define pb push_back
using namespace std;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
long long n, k, a[N], pre[N];
 
void solve(){
	cin >> n >> k;
	pair<long long, int> dp[n + 1][k + 1];
	for(int i = n; i >= 1; --i){
		cin >> a[i];
		for(int j = 1; j <= k; ++j) dp[i][j].F = INT_MIN;
		dp[i][0].F = 0;
	}
	for(int i = 1; i <= n; ++i) {
	    pre[i] = pre[i - 1] + a[i];
	    //cout << a[i] << endl;
	}
	for(int i = 1; i <= n; ++i){
		for(int bars = 1; bars <= k; ++bars){
			if(i - 1 < bars) break;
			for(int j = i - 1; j >= 1; --j){
				if(dp[j][bars - 1].F + ((pre[i] - pre[j]) * pre[j]) > dp[i][bars].F){
					dp[i][bars].F = dp[j][bars - 1].F + ((pre[i] - pre[j]) * pre[j]);
					dp[i][bars].S = j;
				}
			}
		}
	}
	cout << dp[n][k].F << '\n';
	int pos = n, ct = k;
	while(ct > 0){
		cout << n - dp[pos][ct].S << ' ';
		pos = dp[pos][ct].S;
	    --ct;
	}
}
 
int main(){
	fast;
	int t = 1;
	// cin >> t;
	while(t--)
		solve();
	return 0;
}

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