#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
using ll = long long;
struct Line {
ll m = 0, c = 0, id = 0;
Line(ll _m, ll _c, ll _id) : m(_m), c(_c), id(_id) { }
ll get(ll x) { return m * x + c; }
double intersection(Line o) { return (double) (o.c - c) / (double) (m - o.m); }
bool good(Line l2, Line l3) { return __int128(l2.c - c) * (l2.m - l3.m) < __int128(l3.c - l2.c) * (m - l2.m); }
};
struct CHT {
deque<Line> hull;
void insert(Line l) {
while (hull.size() > 1) {
auto last = hull.end()[-1];
auto p_last = hull.end()[-2];
if (p_last.good(last, l)) break;
hull.pop_back();
}
hull.push_back(l);
}
pair<ll, ll> query(ll x) {
while (hull.size() > 1 && hull[0].get(x) < hull[1].get(x)) {
hull.pop_front();
}
return {hull[0].get(x), hull[0].id};
}
};
int par[100002][202];
void testCase() {
int n, K;
cin >> n >> K;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
vector<ll> dp(n + 1);
for (int k = 1; k <= K + 1; k++) {
vector<ll> new_dp(n + 1);
CHT cht;
cht.insert(Line(a[k - 1], dp[k - 1] - a[k - 1] * a[n], k - 1));
for (int i = k; i <= n; i++) {
auto [x, id] = cht.query(a[i]);
par[i][k] = id;
x += a[n] * a[i] - a[i] * a[i];
new_dp[i] = x;
cht.insert(Line(a[i], dp[i] - a[n] * a[i], i));
}
// debug(new_dp);
if (k == K + 1) {
cout << new_dp[n] << "\n";
}
dp = new_dp;
}
vector<int> ans;
{
int cur = n;
int k = K + 1;
while (cur) {
ans.push_back(cur);
cur = par[cur][k];
k--;
}
}
reverse(ans.begin(), ans.end());
ans.pop_back();
for (int i : ans) cout << i << " ";
cout << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
testCase();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
320 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
316 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
440 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1100 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
1156 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1084 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
8528 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
8652 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
54 ms |
8528 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8524 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
47 ms |
8652 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
52 ms |
8560 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
67 ms |
8608 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
39 ms |
8524 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
48 ms |
8644 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
62 ms |
8584 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
52 ms |
82888 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
53 ms |
82968 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
622 ms |
83464 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
52 ms |
83452 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
795 ms |
83144 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
532 ms |
82996 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
590 ms |
83440 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
449 ms |
83424 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
494 ms |
83128 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
595 ms |
83256 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
