Submission #146811

#	Time	Username	Problem	Language	Result	Execution time	Memory
146811		MvC	Split the sequence (APIO14_sequence)	C++14	28 / 100	2071 ms	4852 KiB

sequence

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,k,i,j,t,id,pr[205][nmax];
ll f[205][nmax],a[nmax],p[nmax],mx,x;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>k;
	for(i=1;i<=n;i++)cin>>a[i];
	for(i=1;i<=n;i++)p[i]=p[i-1]+a[i];
	for(i=1;i<=k;i++)
	{
		for(j=0;j<=n;j++)
		{
			for(t=j+1;t<n;t++)
			{
				x=f[i-1][j]+(p[t]-p[j])*(p[n]-p[t]);
				if(x>f[i][t])
				{
					f[i][t]=x;
					pr[i][t]=j;
				}
				if(f[i][t]>mx)
				{
					mx=f[i][t];
					id=t;
				}
			}
		}
	}
	cout<<mx<<endl;
	for(i=k;i>=1;i--)
	{
		cout<<id<<" ";
		id=pr[i][id];
	}
	cout<<endl;
	return 0;
}

Compilation message (stderr)

sequence.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
sequence.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

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