제출 #172216

#제출 시각아이디문제언어결과실행 시간메모리
172216RafaelSus수열 (APIO14_sequence)C++14
50 / 100
1575 ms82124 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; typedef long long ll; const ll inf=1e15; #define pb push_back const int INF=(0x3f3f3f3f); const int maxn=2e3+5; ll dp[maxn][maxn]; pair<int,int> rec[maxn][maxn]; int a[maxn]; ll pref[maxn]; int n,k; ll solve(int left,int key){ if(left>=n||key==0)return 0ll; if(dp[left][key]!=-1)return dp[left][key]; ll sumTotal=pref[n]-pref[left]+a[left]; ll sumLeft=0ll,sumRight=0ll; ll res=-1; int splitPoint=-1; int splitKey=-1; //cerr<<left<<' '<<n<<' '<<key<<'\n'; for(int i=left;i<=n-key;i++){ sumLeft+=a[i]; sumRight=sumTotal-sumLeft; int tmpK=key-1; ll r=solve(i+1,tmpK); ll splitCost=sumLeft*sumRight; ll curRes=r+splitCost; //cerr<<r<<'\n'; if(res<curRes){ res=curRes; splitPoint=i; splitKey=0; } } rec[left][key]=make_pair(splitPoint,splitKey); return dp[left][key]=res; } vector<int>ans; void getAnsw(int l,int r,int key){ if(l==r||key<=0)return; ans.pb(rec[l][key].first); //cerr<<l<<' '<<r<<' '<<key<<' '<<rec[l][r][key].first<<' '<<key<<'\n'; getAnsw(l,rec[l][key].first,rec[l][key].second); getAnsw(rec[l][key].first+1,r,key-rec[l][key].second-1); } int main(){ ios::sync_with_stdio(false); cin.tie(0);cout.tie(0); cin>>n>>k; for(int i=1;i<=n;i++){ cin>>a[i]; if(i>1)pref[i]=pref[i-1]+a[i]; else pref[i]=a[i]; } memset(dp,-1,sizeof dp); ll answ=solve(1,k); getAnsw(1,n,k); cout<<answ<<'\n'; for(auto x:ans) cout<<x<<' '; cout<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...