#include <bits/stdc++.h>
using namespace std;
#define int long long
struct L {
int a, b, from;
int operator()(int x) { return a * x + b; }
pair<int, int> inter(L &he) const
{
int up = he.b - b;
int down = a - he.a;
return {up, down};
}
};
struct CHT {
vector<L> hull;
int start = 0;
pair<int, int> query(int x, int i)
{
while(start <= (int)hull.size() - 2) {
L A = hull[start], B = hull[start + 1];
if(B.from < i && A(x) <= B(x))
start++;
else
break;
}
return {hull[start](x), hull[start].from};
}
void add(L x)
{
if(!hull.empty() && hull.back().a == x.a) {
if(hull.back().b < x.b) {
hull.pop_back();
}
else {
return;
}
}
while(start <= (int)hull.size() - 2) {
L A = hull.end()[-2], B = hull.end()[-1];
auto one = A.inter(B), two = B.inter(x);
if(one.first * two.second > two.first * one.second) {
hull.pop_back();
}
else {
break;
}
}
hull.push_back(x);
}
};
int sq(int x) { return x * x; }
int32_t main()
{
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<int> p(n + 1);
for(int i = 1; i <= n; i++) {
cin >> p[i];
p[i] += p[i - 1];
}
CHT dp;
for(int i = 1; i <= n; i++) {
dp.add({p[i], -sq(p[i]), i});
}
vector<vector<int32_t>> come(k + 1, vector<int32_t>(n + 1));
for(int now = 1; now <= k; now++) {
CHT new_dp;
for(int i = now + 1; i <= n; i++) {
auto in = dp.query(p[i], i);
if(now == k && i == n) {
cout << in.first << '\n';
}
come[now][i] = in.second;
if(i < n) {
new_dp.add({p[i], in.first - sq(p[i]), i});
}
}
dp = new_dp;
}
vector<int> print(k);
int nn = n, kk = k;
while(kk) {
nn = come[kk][nn];
kk--;
print[kk] = nn;
}
for(int i = 0; i < k; i++) {
cout << print[i] << " ";
}
cout << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
980 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
596 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1060 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
60 ms |
9176 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
1404 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
37 ms |
6068 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
36 ms |
6464 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
54 ms |
7184 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
42 ms |
6088 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
43 ms |
6752 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
55 ms |
8328 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
9488 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
17 ms |
9400 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
402 ms |
88084 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
18 ms |
11036 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
498 ms |
86816 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
286 ms |
61380 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
383 ms |
68400 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
266 ms |
57276 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
328 ms |
63972 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
381 ms |
79628 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
