Submission #744984

#	Time	Username	Problem	Language	Result	Execution time	Memory
744984		sudheerays123	Split the sequence (APIO14_sequence)	C++17	0 / 100	60 ms	131072 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 10000+5 , K = 200+5 , INF = 1e18 , MOD = 1e9+7;

ll n,k;
ll dp[N][N],opt[N][N];
vector<ll> presum(N);

ll go(ll i , ll j){

	if(j > k+1) return -INF;
	if(i == n+1){
		if(j < k+1) return -INF;
		return 0;
	}

	if(dp[i][j] != -1) return dp[i][j];

	ll ans = -INF,ind;

	for(ll k = i; k <= n; k++){
		ll cur = go(k+1,j+1)+(presum[k]-presum[i-1])*(presum[n]-presum[k]);
		if(cur > ans){
			ans = cur;
			ind = k+1;
		}
	}

	opt[i][j] = ind;
	return dp[i][j] = ans;
}

void solve(){

	cin >> n >> k;

	vector<ll> a(n+5);
	for(ll i = 1; i <= n; i++) cin >> a[i];
	for(ll i = 1; i <= n; i++) presum[i] = presum[i-1]+a[i];

	memset(dp,-1,sizeof dp);
	cout << go(1,0) << "\n";

	ll curi = 1 , curj = 0;

	while(true){
		curi = opt[curi][curj];
		curj++;
		if(curi == n+1) break;
		cout << curi-1 << " ";
	}
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'long long int go(long long int, long long int)':
sequence.cpp:31:12: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  opt[i][j] = ind;
      |  ~~~~~~~~~~^~~~~

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