#include <bits/stdc++.h>
using i64 = long long;
struct line {
i64 a, b;
line(i64 _a, i64 _b) : a(_a), b(_b) {}
long double intersect(line rhs) {
return (long double)(b - rhs.b) / (rhs.a - a);
}
i64 eval(i64 x) {
return a * x + b;
}
bool operator== (line rhs) {
return a == rhs.a && b == rhs.b;
}
};
namespace std {
std::string to_string(line l) {
return '(' + to_string(l.a) + "x + " + to_string(l.b) + ')';
}
};
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) void(23)
#endif
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];
}
std::deque<std::pair<line, int>> dq;
auto size = [&]() -> int { return (int) dq.size(); };
auto Add = [&](line l, int idx) -> void {
while(size() >= 2 && (l == dq[0].first || l.intersect(dq[0].first) >= dq[0].first.intersect(dq[1].first))) {
dq.pop_front();
}
if(size() && l == dq[0].first) {
dq.pop_front();
}
dq.emplace_front(l, idx);
};
auto Query = [&](i64 x) -> std::pair<i64, int> {
int l = 0, r = size() - 1;
while(l < r) {
int m = (l + r) >> 1;
if(dq[m].first.eval(x) < dq[m + 1].first.eval(x)) {
l = m + 1;
} else {
r = m;
}
}
return {dq[l].first.eval(x), dq[l].second};
};
for(int k = 1; k <= K; k++) {
dq.clear();
Add({0, 0}, 0);
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]);
// }
// }
auto [v, j] = Query(p[N] - p[i]);
dp[k][i] = v + 1LL * p[i] * (p[N] - p[i]);
go[k][i] = j;
Add(line{-p[i], dp[k - 1][i]}, i);
debug(dq);
debug(k, i, dp[k][i], go[k][i]);
}
}
int ans = 1;
for(int i = 1; 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 |
8536 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
10588 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
14680 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
8668 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
8536 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
7 ms |
59740 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
16732 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
4 ms |
33116 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
3 ms |
16732 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
3 ms |
20952 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
8536 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
21 ms |
130840 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
8536 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
16 ms |
130136 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
19 ms |
130444 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
20 ms |
130764 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
7 ms |
55644 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
5 ms |
35164 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
9 ms |
70236 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Runtime error |
36 ms |
131072 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
8796 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
5 ms |
8940 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Runtime error |
196 ms |
131072 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
50 ms |
11384 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
46 ms |
11100 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Execution timed out |
2032 ms |
131072 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |