#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];
vector<vector<ll>>dp;
vector<vector<pair<int,int>>>rec;
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];
}
dp.resize(n+1,vector<ll>(k+1,-1ll));
rec.resize(n+1,vector<pair<int,int>>(k+1,{0,0}));
//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 time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
888 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
508 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
504 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
8 ms |
504 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
395 ms |
3636 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
8 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
401 ms |
3632 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
363 ms |
3192 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
400 ms |
3704 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
404 ms |
3704 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
111 ms |
1144 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
205 ms |
1660 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
3 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
3 ms |
632 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
