#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct line {
int idx;
ll a, b;
line(int idx, ll a, ll b) : idx(idx), a(a), b(b) {}
ll cost(int x) const {
return a * (x - a) + b;
}
ll intersect(line const& other) {
ll lo = other.a;
ll hi = 1LL << 60;
while (lo < hi) {
ll mid = (lo + hi) / 2;
if (cost(mid) > other.cost(mid)) {
lo = mid + 1;
} else {
hi = mid;
}
}
return lo;
}
};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<ll> pref(n, 0);
partial_sum(a.begin(), a.end(), pref.begin());
ll dp[k + 1][n];
int parent[k + 1][n];
for (int j = 0; j < n; ++j) {
dp[0][j] = 0;
}
for (int i = 1; i <= k; ++i) {
for (int j = 0; j < n; ++j) {
dp[i][j] = LLONG_MIN;
}
}
for (int i = 1; i <= k; ++i) {
deque<line> dq;
for (int j = 0; j < n; ++j) {
while (dq.size() > 1 &&
dq[0].cost(pref[j]) <= dq[1].cost(pref[j])) {
dq.pop_front();
}
if (!dq.empty()) {
dp[i][j] = dq[0].cost(pref[j]);
parent[i][j] = dq[0].idx;
}
line l(j, pref[j], dp[i - 1][j]);
while (dq.size() > 1) {
int sz = dq.size();
ll t1 = dq[sz - 2].intersect(dq[sz - 1]);
ll t2 = dq[sz - 1].intersect(l);
if (t1 < t2) break;
dq.pop_back();
}
dq.push_back(l);
}
}
cout << dp[k][n - 1] << endl;
int u = n - 1;
for (int i = k; i > 0; --i) {
u = parent[i][u];
cout << (u + 1) << ' ';
}
cout << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Incorrect |
2 ms |
256 KB |
contestant didn't find the optimal answer: 951 < 999 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
contestant didn't find the optimal answer: 1091288 < 1093956 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
256 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
9 ms |
764 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Incorrect |
2 ms |
376 KB |
contestant didn't find the optimal answer: 136631827923 < 1499437552673 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
376 KB |
contestant didn't find the optimal answer: 20180056 < 21503404 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
964 KB |
contestant didn't find the optimal answer: 1794250000 < 1818678304 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
173 ms |
6052 KB |
contestant didn't find the optimal answer: 6292740000 < 19795776960 |
2 |
Halted |
0 ms |
0 KB |
- |