제출 #1066422

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1066422		beaconmc	수열 (APIO14_sequence)	C++14	28 / 100	122 ms	10076 KiB

sequence

#include <vector>
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;

ll dp[1001][201];
ll prevs[1001][201];


int main(){
	

	ll n,k;
	cin >> n >> k;
	vector<ll> arr(n);
	vector<ll> pref(n);
	FOR(i,0,n) cin >> arr[i];
	pref[0] = arr[0];
	FOR(i,1,n) pref[i] = pref[i-1]+arr[i];

	FOR(i,0,1001)FOR(j,0,201) dp[i][j] = 0;



	deque<vector<ll>> sus;


	FOR(i,1,n+1){
		FOR(j,1,k+1){
			FOR(m,0, i){
				ll temp = dp[m][j-1] + (pref[n-1] - pref[i-1]) * (pref[i-1]-pref[m]+arr[m]);
				if (dp[i][j] < temp){
					dp[i][j] = temp;
					prevs[i][j] = m;
				}
			}
		}
	}

	ll maxi = -1;
	ll pos = -1;
	FOR(i,0,n) if (dp[i][k] > maxi) maxi = dp[i][k], pos = i;

	cout << dp[pos][k] << endl;

	while (pos != 0){
		ll sus = prevs[pos][k];
		k--;
		cout << pos << " ";
		pos  = sus;
		
	}

}

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