#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const maxn = 1010;
int const maxk = 210;
ll const inf = 0x3f3f3f3f3f3f3f3f;
ll p[maxn];
ll dp[maxk][maxn], opt[maxk][maxn];
ll solve(int k, int n) {
if (dp[k][n] >= 0) return dp[k][n];
if (k == 0) return 0;
if (n == 1) return -inf;
ll& d = dp[k][n];
ll& op = opt[k][n];
d = -inf, op = 1;
for (int i = 1; i < n; i++) {
ll cost = p[i] * (p[n]-p[i]) + solve(k-1, i);
if (cost > d) {
op = i;
d = cost;
}
}
return d;
}
vector<ll> recover(int k, int n) {
vector<ll> res;
while (k != 0) {
res.push_back(opt[k][n]);
n = opt[k][n];
k--;
}
reverse(res.begin(), res.end());
return res;
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
memset(dp, -1, sizeof(dp));
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> p[i];
p[i] += p[i-1];
}
ll ans = solve(k, n);
auto res = recover(k, n);
cout << ans << "\n";
for (ll i : res) cout << i << " ";
cout << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
4 ms |
2012 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
4 ms |
2048 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
4 ms |
2040 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Execution timed out |
2056 ms |
2140 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Execution timed out |
2039 ms |
2424 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
2040 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
7 ms |
2040 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Execution timed out |
2050 ms |
2396 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
6 ms |
3832 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
6 ms |
3832 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |