#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 = N - K; i < N; 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 |
4444 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 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 |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Incorrect |
0 ms |
2396 KB |
contestant didn't find the optimal answer: 0 < 1 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Incorrect |
1 ms |
4440 KB |
contestant didn't find the optimal answer: 301650081 < 302460000 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Incorrect |
1 ms |
4444 KB |
contestant didn't find the optimal answer: 307860780 < 311760000 |
3 |
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 |
Incorrect |
2 ms |
4444 KB |
contestant didn't find the optimal answer: 139451796 < 140412195 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
170 ms |
4872 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Incorrect |
141 ms |
4692 KB |
contestant didn't find the optimal answer: 1201280260 < 1326260195 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2065 ms |
4956 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |