제출 #265537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
265537		tko919	수열 (APIO14_sequence)	C++17	33 / 100	10 ms	2560 KiB

sequence

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

ll dp[201][1010]={},pre[201][1010];

int main(){
   int n,k; cin>>n>>k;
   if(n>1000)return 0;
   vector<ll> a(n),rui(n+1);
   rep(i,0,n){
      cin>>a[i]; rui[i+1]=a[i];
   }
   rep(i,0,n)rui[i+1]+=rui[i];
   rep(i,0,n+1)rep(j,0,k+1)dp[i][j]=-INF;
   dp[0][0]=0;
   rep(i,1,k+1)rep(j,1,n)rep(i2,0,j){
      ll add=(rui[j]-rui[i2])*(rui[n]-rui[j]);
      if(chmax(dp[i][j],dp[i-1][i2]+add))pre[i][j]=i2;
   }
   ll res=-INF; int pos=-1;
   rep(i,0,n)if(chmax(res,dp[k][i]))pos=i;
   cout<<res<<endl;
   int cur=k; vector<int> ps;
   while(cur){
      ps.push_back(pos);
      pos=pre[cur][pos]; cur--;
   }
   reverse(ALL(ps));
   rep(i,0,k)cout<<ps[i]<<endl;
   return 0;
}

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