#include <bits/stdc++.h>
#define int long long
#define double long double
#define all(x) x.begin(), x.end()
using namespace std;
struct Line {
int k;
int b;
Line(int k_, int b_) : k(k_), b(b_) {}
};
struct CHT {
const int INF = (int) 1e18;
vector<Line> lns;
vector<double> pts = {(double) -INF};
vector<int> inds;
double inter(Line ln1, Line ln2) {
double x = (ln2.b - ln1.b) / (double) (ln1.k - ln2.k);
return x;
}
void add(int k, int b, int ind) {
Line nln(k, b);
while ((int) lns.size() > 1) {
if (k == lns.back().k) {
if (b < lns.back().b) {
return;
}
lns.pop_back();
inds.pop_back();
pts.pop_back();
continue;
}
double nx = inter(nln, lns[(int) lns.size() - 2]);
if (nx < pts.back()) {
lns.pop_back();
inds.pop_back();
pts.pop_back();
} else {
break;
}
}
if (!lns.empty() && lns.back().k == k) {
if (b < lns.back().b) {
return;
}
lns.pop_back();
inds.pop_back();
lns.push_back(nln);
inds.push_back(ind);
} else {
lns.push_back(nln);
inds.push_back(ind);
if ((int) lns.size() > 1) {
pts.push_back(inter(lns.back(), lns[(int) lns.size() - 2]));
}
}
}
pair<int, int> best(int x) {
int l = 0, r = pts.size();
while (r - l > 1) {
int m = (l + r) / 2;
if (pts[m] > x) {
r = m;
} else {
l = m;
}
}
return {lns[l].k * x + lns[l].b, inds[l]};
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
vector<vector<int>> dp(k + 1, vector<int>(n + 1, 0));
vector<vector<int>> prev(k + 1, vector<int>(n + 1, -1));
dp[0][0] = 0;
for (int j = 1; j <= k; j++) {
CHT cht;
cht.add(a[j - 1], dp[j - 1][j - 1] - a[j - 1] * a[j - 1], j - 1);
dp[j][0] = 0;
for (int i = j; i <= n; i++) {
auto res = cht.best(a[i]);
dp[j][i] = res.first;
prev[j][i] = res.second;
cht.add(a[i], dp[j - 1][i] - a[i] * a[i], i);
}
}
int ans = dp[k][n];
cout << ans << '\n';
vector<int> path;
int now = n;
for (int i = k; i >= 1; i--) {
now = prev[i][now];
path.push_back(now);
}
reverse(all(path));
for (int el : path) {
cout << el << ' ';
}
cout << '\n';
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1004 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1004 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
23 ms |
3564 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
24 ms |
3564 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
20 ms |
3052 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
23 ms |
3564 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
23 ms |
3564 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
1004 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
1644 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1516 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
1572 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
349 ms |
33052 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
1904 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
195 ms |
19900 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
221 ms |
23020 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
264 ms |
25008 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
214 ms |
20588 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
246 ms |
23488 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
314 ms |
29760 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
74 ms |
14212 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
74 ms |
14088 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
80 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
