#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
void solve() {
int n,k;
cin>>n>>k;
k++;
ll a[n+1],pre[n+1];
pre[0]=0;
for(int i=1;i<=n;i++){
cin>>a[i];
pre[i]=pre[i-1]+a[i];
}
ll dp[n+1][k+1],prev[n+1][k+1];
memset(dp,0,sizeof(dp));
for(int i=0;i<=n;i++){
for(int j=i+1;j<=k;j++)dp[i][j]=-1e18;
if(i)dp[i][0]=-1e18;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
for(int x=1;x<=i;x++){
dp[i][j]=max(dp[i][j],pre[x-1]*(pre[i]-pre[x-1])+dp[x-1][j-1]);
if(dp[i][j]==pre[x-1]*(pre[i]-pre[x-1])+dp[x-1][j-1])prev[i][j]=x-1;
}
}
}
cout<<dp[n][k]<<'\n';
vector<int> ans;
int c=n,x=k;
while(c){
ans.pb(c);
c=prev[c][x];
x--;
}
reverse(ans.begin(),ans.end());
ans.pop_back();
for(int i:ans)cout<<i<<' ';
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
452 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
456 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
11 ms |
860 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
860 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
860 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
860 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
604 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
348 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
348 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
193 ms |
3416 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
344 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
187 ms |
3420 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
162 ms |
3148 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
194 ms |
3420 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
182 ms |
3608 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
32 ms |
1116 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
71 ms |
1628 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
257 ms |
1372 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
244 ms |
1376 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2077 ms |
32224 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2017 ms |
9816 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
