제출 #239935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
239935		michao	수열 (APIO14_sequence)	C++14	50 / 100	2071 ms	2712 KiB

sequence

#include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=2005;
ll dp[205][MAX];
ll tab[MAX];
int pref[MAX];
ll prefix(int a,int b)
{
	return pref[b]-pref[a-1];
}

vi ans;

int32_t main()
{
  BOOST;
  int n,k;
  cin>>n>>k;
  for (int i=1;i<=n;i++)cin>>tab[i];
  for (int i=1;i<=n;i++)pref[i]=pref[i-1]+tab[i];
  for (int i=1;i<=k;i++)
  	for (int j=1;j<=n;j++)
  		for (int l=j;l>=2;l--)
  		  dp[i][j]=max(dp[i][j],prefix(l,j)*prefix(1,l-1)+dp[i-1][l-1]);
  cout<<dp[k][n]<<"\n";
  int wsk=n;
  for (int i=k;i>=1;i--)
  	for (int j=wsk;j>=2;j--)
  		if (dp[i][wsk]==prefix(j,wsk)*prefix(1,j-1)+dp[i-1][j-1])
  		{
  			wsk=j-1;
  			ans.pb(j-1);
  			break;
  		}
  
  for (auto it:ans)cout<<it<<" ";
  return 0;
}

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