#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end
ll dp[1010][1010]={},pre[1010][1010];
int main(){
int n,k; cin>>n>>k;
assert(n<=1000);
vector<ll> a(n),rui(n+1);
rep(i,0,n){
cin>>a[i]; rui[i+1]=a[i];
}
rep(i,0,n)rui[i+1]+=rui[i];
rep(i,0,n+1)rep(j,0,k+1)dp[i][j]=-INF;
dp[0][0]=0;
rep(i,1,k+1)rep(j,1,n)rep(i2,0,j)if(dp[i-1][i2]>=0){
ll add=(rui[j]-rui[i2])*(rui[n]-rui[j]);
if(chmax(dp[i][j],dp[i-1][i2]+add))pre[i][j]=i2;
}
ll res=-INF; int pos=-1;
rep(i,0,n)if(chmax(res,dp[k][i]))pos=i;
cout<<res<<endl;
int cur=k; vector<int> ps;
while(cur){
ps.push_back(pos);
pos=pre[cur][pos]; cur--;
}
reverse(ALL(ps));
rep(i,0,k)cout<<ps[i]<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
360 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1128 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
2432 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
2304 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
2432 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
1536 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
1664 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4352 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
4352 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
160 ms |
7932 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
4352 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
196 ms |
7928 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
165 ms |
7416 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
162 ms |
7932 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
158 ms |
7932 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
50 ms |
5112 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
99 ms |
5880 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 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
