Submission #1216482

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216482		elotelo966	Split the sequence (APIO14_sequence)	C++20	50 / 100	130 ms	11356 KiB

sequence

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

#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 1005
//#define N 500050

typedef long long lo;

const int mod=1000000007;

int n,k;

int dizi[lim],pre[lim];

int dp[lim][lim],yol[lim][lim];

int32_t main(){
	faster
	cin>>n>>k;
	
	FOR{
		cin>>dizi[i];
		pre[i]=pre[i-1]+dizi[i];
	}
	
	for(int i=0;i<=n;i++){
		for(int j=0;j<=k;j++){
			dp[i][j]=LLONG_MIN;
		}
	}
	
	dp[0][0]=0; // 0.indeks 0.eleman alışım
	
	FOR{
		for(int j=1;j<=k;j++){
			for(int l=i-1;l>=0;l--){
				if(dp[l][j-1]!=LLONG_MIN && dp[i][j]<dp[l][j-1]+(pre[i]-pre[l])*(pre[n]-pre[i])){
					dp[i][j]=max(dp[i][j],dp[l][j-1]+(pre[i]-pre[l])*(pre[n]-pre[i]));
					yol[i][j]=l;
				}
			}
		}
	}
	
	int cev=LLONG_MIN,bas=0;
	
	FOR{
		if(cev<dp[i][k]){
			cev=dp[i][k];
			bas=i;
		}
	}
	
	//~ FOR{
		//~ for(int j=0;j<=k;j++){
			//~ cout<<dp[i][j]<<" ";
		//~ }
		//~ cout<<endl;
	//~ }
	
	vector<int> ans;
	
	for(int i=k;i>=1;i--){
		ans.pb(bas);
		bas=yol[bas][i];
	}
	
	cout<<cev<<'\n';
	
	reverse(ans.begin(),ans.end());
	
	for(auto a:ans){
		cout<<a<<" ";
	}
	
	cout<<'\n';
	
	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