#include <bits/stdc++.h>
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) void(23)
#endif
using i64 = long long;
constexpr int maxN = 1E5 + 5;
constexpr int maxK = 200 + 5;
int A[maxN], go[maxK][maxN];
i64 dp[maxK][maxN], p[maxN];
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, K;
std::cin >> N >> K;
for(int i = 1; i <= N; i++) {
std::cin >> A[i];
}
for(int i = 1; i <= N; i++) {
p[i] = p[i - 1] + A[i];
}
for(int k = 1; k <= K; k++) {
for(int i = 1; i <= N; i++) {
for(int j = 0; j < i; j++) {
if(dp[k - 1][j] + 1LL * (p[i] - p[j]) * (p[N] - p[i]) > dp[k][i]) {
go[k][i] = j;
dp[k][i] = dp[k - 1][j] + 1LL * (p[i] - p[j]) * (p[N] - p[i]);
}
}
}
}
int ans = 1;
for(int i = 1; i <= N - 1; i++) {
if(dp[K][i] > dp[K][ans]) {
ans = i;
}
}
std::cout << dp[K][ans] << '\n';
std::vector<int> v;
for(int k = K; k >= 1; k--) {
v.emplace_back(ans);
ans = go[k][ans];
}
for(int i = K - 1; i >= 0; i--) {
std::cout << v[i] << " \n"[i == 0];
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 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 |
348 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4592 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
3 ms |
21084 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
4692 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
12892 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
14 ms |
75632 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
10 ms |
58716 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
13 ms |
69468 KB |
Integer 0 violates the range [1, 199] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4444 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
4592 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
101 ms |
71068 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
115 ms |
74900 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
92 ms |
70360 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
103 ms |
81108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
102 ms |
83028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
23 ms |
19292 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
43 ms |
34156 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
173 ms |
4896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
145 ms |
4908 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2074 ms |
25228 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2067 ms |
4956 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |