#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e3+9,K=209,MX=1e9+9;
ll n,k,ans=-MX,idx;
ll pre[inf],a[inf];
pair<ll,ll> dp[inf][K];
vector<ll> split;
ll sum(ll x,ll y){
return pre[y]-pre[x];
}
int main(){
cin>>n>>k;
for(ll i=1;i<=n;i++)
cin>>a[i],pre[i]=pre[i-1]+a[i];
for(ll j=1;j<=k;j++)
for(ll i=1;i<=n;i++)
for(ll z=0;z<i;z++)
dp[i][j]=max(dp[i][j],make_pair(dp[z][j-1].first+sum(z,i)*sum(i,n),z));
for(ll i=1;i<=n;i++)
if(ans<dp[i][k].first)
ans=dp[i][k].first,idx=i;
split.push_back(idx);
for(ll j=k;j>1;j--)
idx=dp[idx][j].second,split.push_back(idx);
reverse(split.begin(),split.end());
cout<<ans<<endl;
for(auto o:split)
cout<<o<<" ";
cout<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
1024 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
8 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
1024 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
9 ms |
1024 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
1024 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
1024 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
3584 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
9 ms |
3584 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
176 ms |
3652 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
8 ms |
3584 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
201 ms |
3644 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
179 ms |
3584 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
183 ms |
3584 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
181 ms |
3676 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
46 ms |
3680 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
84 ms |
3584 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
512 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 |
2 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
