Submission #365157

#	Time	Username	Problem	Language	Result	Execution time	Memory
365157		YJU	Split the sequence (APIO14_sequence)	C++14	50 / 100	161 ms	33516 KiB

sequence

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e3+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll dp[N][N],n,k,u[N],from[N][N];
vector<ll> ans;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>k;
	REP1(i,n)cin>>u[i],u[i]+=u[i-1];
	REP1(i,n)dp[0][i]=-INF;
	dp[0][0]=0;
	REP1(T,k+1){
		REP1(i,n){
			dp[T][i]=-INF;
			REP(j,i){
				if(dp[T-1][j]-u[j]*u[j]+u[j]*u[i]>=dp[T][i])from[T][i]=j;
				dp[T][i]=max(dp[T][i],dp[T-1][j]-u[j]*u[j]+u[j]*u[i]);
			};
		}
	}
	cout<<dp[k+1][n]<<"\n";
	for(int T=k+1,i=n;T>=1&&from[T][i];T--){
		ans.pb(i=from[T][i]);
	}
	reverse(ans.begin(),ans.end());
	REP(i,k)cout<<ans[i]<<(i==k-1?"\n":" ");
	return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/

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