제출 #668937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668937		Dan4Life	Split the sequence (APIO14_sequence)	C++17	0 / 100	61 ms	131072 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(a) a.begin(),a.end()
#define mp make_pair
#define fi first
#define se second

const int maxn = (int)1e3+10;
int n, K, a[maxn], pre[maxn];
int dp[maxn][maxn][201];
int p[maxn][maxn];
vector<int> v;
int sum(int i, int j) {return pre[j+1]-pre[i];}

int recur(int l, int r, int k){
    if(r-l+1<=k or !k) return 0;
    if(dp[l][r][k]!=-1) return dp[l][r][k];
    int ans = 0;
    /*int xx =l, yy=r-1;
    while(xx<yy){
        int mid = (xx+yy+1)/2;
        if(sum(l,mid)<=sum(mid+1,r)) xx=mid;
        else yy=mid-1;
    }*/

    //for(int x = max(l,xx-25); x < min(r,xx+25); x++){
    for(int x = l; x < r; x++){
        if(r-(x+1)+1 <=k-1) break;
        int tot = recur(x+1,r,k-1)+sum(l,x)*sum(x+1,r);
        if(ans < tot) ans=tot, p[l][r]=x;
    }
    return dp[l][r][k]=ans;
}

void recur2(int l, int r, int k){
    if(r-l+1<=k or !k) return;
    v.pb(p[l][r]);  recur2(p[l][r]+1,r,k-1);
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> K; memset(dp,-1,sizeof(dp));
    for(int i = 0; i < n; i++) cin >> a[i], pre[i+1]=pre[i]+a[i];
    cout << recur(0,n-1,K) << "\n"; recur2(0,n-1,K);
    sort(all(v)); for(auto u : v) cout << u+1 << " ";
}

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