#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e3 + 10, K = 210;
const ll INF = 1e18;
ll dp[N][K], ps[N];
int par[N][K];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k; cin >> n >> k;
++k;
for(int i=0; i<n; i++){
int x; cin >> x;
ps[i + 1] = ps[i] + x;
}
for(int j=2; j<=k; j++)
for(int i=1; i<=n; i++){
dp[i][j] = -INF;
for(int c=i-1; c>0; c--){
if(dp[i][j] < (ps[i] - ps[c]) * ps[c] + dp[c][j - 1])
par[i][j] = c;
dp[i][j] = max(dp[i][j], (ps[i] - ps[c]) * ps[c] + dp[c][j - 1]);
}
}
cout << dp[n][k] << '\n';
while(k > 1){
cout << par[n][k] << ' ';
n = par[n][k];
--k;
}cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
4672 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
4672 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
4672 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
4672 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
4672 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
4672 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
173 ms |
4672 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
4672 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
186 ms |
4672 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
156 ms |
4672 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
176 ms |
4672 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
176 ms |
4672 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
66 ms |
4672 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
106 ms |
4672 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
3 ms |
4672 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 |
9 ms |
4672 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
