Submission #100190

#	Time	Username	Problem	Language	Result	Execution time	Memory
100190		TadijaSebez	Split the sequence (APIO14_sequence)	C++11	49 / 100	159 ms	132096 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100050;
const int K=205;
const ll inf=1e18;
int a[N];
ll sum[N];
ll dp[N][K];
int best[N][K];
void Solve(int k, int ss, int se, int l, int r)
{
	if(ss>se) return;
	int mid=ss+se>>1;
	dp[mid][k]=-inf;
	for(int i=l;i<=min(r,mid);i++)
	{
		ll tmp=dp[i-1][k-1]+(sum[mid]-sum[i-1])*sum[i-1];
		if(tmp>dp[mid][k]) dp[mid][k]=tmp,best[mid][k]=i;
	}
	Solve(k,ss,mid-1,l,best[mid][k]);
	Solve(k,mid+1,se,best[mid][k],r);
}
int main()
{
	int n,k;
	scanf("%i %i",&n,&k);k++;
	for(int i=1;i<=n;i++) scanf("%i",&a[i]),sum[i]=sum[i-1]+a[i],dp[i][0]=-inf;
	for(int i=1;i<=k;i++) Solve(i,1,n,1,n);
	printf("%lld\n",dp[n][k]);
	vector<int> ans;
	for(int i=n,j=k;i>0;i=best[i][j]-1,j--) ans.push_back(i);
	reverse(ans.begin(),ans.end());
	ans.pop_back();
	for(int i:ans) printf("%i ",i);
	return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'void Solve(int, int, int, int, int)':
sequence.cpp:14:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
sequence.cpp: In function 'int main()':
sequence.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&k);k++;
  ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:28:62: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%i",&a[i]),sum[i]=sum[i-1]+a[i],dp[i][0]=-inf;
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

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