#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pll pair<ll,ll>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl;
#define MP make_pair
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define ALL(x) x.begin(),x.end()
#define endl "\n"
const ll inf=1e18;
const ll maxn=11111;
ll dp[maxn][222];
ll a[maxn],pre[maxn];
pll fa[maxn][222];
void dfs(pll u){
if(u==MP(0ll,0ll))return;
dfs(fa[u.fi][u.se]);
cout<<u.fi<<" ";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,K;cin>>n>>K;
rep(i,1,n+1)cin>>a[i];
rep(i,1,n+1)pre[i]=pre[i-1]+a[i];
rep(k,1,K+1){
rep(i,1,n+1){
rep(j,0,i){
if(dp[j][k-1]+(pre[i]-pre[j])*(pre[n]-pre[i])>dp[i][k]){
dp[i][k]=dp[j][k-1]+(pre[i]-pre[j])*(pre[n]-pre[i]);
fa[i][k]=MP(j,k-1);
}
}
}
}
/*
rep(i,1,n+1){
rep(j,0,K+1)cout<<dp[i][j]<<" ";
cout<<endl;
}
*/
ll mx=-inf;
pll p=MP(0ll,0ll);
rep(i,1,n+1){
if(dp[i][K]>mx){
mx=dp[i][K];
p=MP(i,K);
}
}
cout<<mx<<endl;
dfs(p);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
2520 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4560 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
4700 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
4700 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
5 ms |
4700 KB |
Integer 0 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
8028 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
8028 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
123 ms |
8028 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
8228 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
118 ms |
8140 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
98 ms |
8028 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
126 ms |
8164 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
125 ms |
8028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
26 ms |
8028 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
51 ms |
8144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
383 ms |
54824 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
390 ms |
54572 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2060 ms |
54352 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
224 ms |
118280 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
