Submission #395863

#	Time	Username	Problem	Language	Result	Execution time	Memory
395863		amunduzbaev	Split the sequence (APIO14_sequence)	C++14	0 / 100	10 ms	10376 KiB

sequence

/* made by amunduzbaev */

#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define tut(x) array<int, x> 
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;

template<class T> bool umin(T& a, const T& b) { return a > b? a = b, true:false; }
template<class T> bool umax(T& a, const T& b) { return a < b? a = b, true:false; }
//void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	//freopen((s+".out").c_str(),"w",stdout); }
//template<class T> tree<T, 
//less<T>, null_type, rb_tree_tag, 
//tree_order_statistics_node_update> ordered_set;

const int N = 1e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

#define MULTI 0
int n, m, K, s, ans, q, res, a[N], pref[N];
int dp[N][N], mx[N][205], par[N][205];

void solve(int t_case) {
	cin>>n>>K;
	
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<n;i++){
		pref[i] = a[i];
		if(i) pref[i] += pref[i-1];
	} 
	
	
	for(int k=1;k<=K;k++){
		for(int i=k;i<n;i++){
			for(int j=k;j<=i;j++) dp[i][j] = mx[j-1][k-1] + (pref[i] - pref[j-1]) * pref[j-1];
			mx[i][k] = -1;
			for(int j=k;j<=i;j++) if(umax(mx[i][k], dp[i][j])) par[i][k] = j;
		}
	}
	
	res = mx[n-1][K];
	vii tt;
	int in = n-1, k = K;
	while(par[in][k]){
		tt.pb(par[in][k]);
		in = par[in][k] - 1, k--;
	} 
	
	cout<<res<<"\n";
	//sort(all(tt));
	//for(auto x : tt) cout<<x<<" ";
	//cout<<"\n";
}

signed main(){ 
	NeedForSpeed
	if(!MULTI) {
		solve(1);
	} else {
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} return 0;
}

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