#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n+1), p(n+1);
for(int i=0; i < n; i++){
cin >> a[i+1];
p[i+1] = p[i] + a[i+1];
}
vector<vector<int64_t>> dp(n+1, vector<int64_t>(k+1, 0));
vector<vector<int64_t>> par(n + 1, vector<int64_t>(k + 1, 0));
int besti, bestj;
int64_t ans = -1;
for(int i=1; i <= n; i++){
for(int j=1; j <= k; j++){
for(int l = 0; l < i; l++){
if(dp[i][j] < dp[l][j-1] + (p[i]-p[l]) * (p[n]-p[i])){
dp[i][j] = dp[l][j-1] + (p[i] - p[l]) * (p[n] - p[i]);
par[i][j] = l;
}
if(j==k){
if(ans < dp[i][j]){
ans = dp[i][j];
besti = i; bestj = j;
}
}
//cerr << "I: " << i << " J: " << j << " K: " << k << " P[i]: " << p[i] << " P[l-1] " << p[l-1] << "\n";
}
//cerr << "(" << i << "," << j << ") " << dp[i][j] << "\n";
}
}
cout << ans << "\n";
assert(bestj == k);
vector<int> res;
for(int i=0; i < k; i++){
res.push_back(besti);
besti = par[besti][bestj];
bestj--;
}
reverse(res.begin(), res.end());
for(int i : res){
cout << i << " ";
}
cout << "\n";
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:14:16: warning: 'bestj' may be used uninitialized in this function [-Wmaybe-uninitialized]
14 | int besti, bestj;
| ^~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 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 |
0 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 |
384 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 |
0 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 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 |
1 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 |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Incorrect |
1 ms |
384 KB |
Integer 0 violates the range [1, 49] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Incorrect |
12 ms |
1024 KB |
Integer 0 violates the range [1, 199] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Incorrect |
336 ms |
3608 KB |
declared answer doesn't correspond to the split scheme: declared = 391498272124, real = 49482974465404 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
433 ms |
1792 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
271 ms |
2012 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2102 ms |
32512 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2100 ms |
15224 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |