/**
* author: NimaAryan
* created: 2024-08-15 09:11:58
**/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#endif
using i64 = long long;
using i128 = __int128_t;
constexpr i64 inf = 1E15;
struct Line {
i64 a, b;
int i;
i64 operator()(int x) const {
return a * x + b;
}
bool intersects_earlier(const Line& A, const Line& B) {
return (i128) (A.b - b) * (a - B.a) <= (i128) (B.b - b) * (a - A.a);
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<i64> s(n + 1);
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + a[i];
}
vector<i64> f(n + 1);
f[0] = -inf;
vector to(k + 1, vector<int>(n + 1));
iota(to[0].begin(), to[0].end(), 0);
to[0][0] = -1;
for (int kk = 1; kk <= k; ++kk) {
vector<i64> g(n + 1);
deque<Line> f_max;
for (int i = 0, z = 0; i <= n; ++i) {
while (z >= 2 && f_max[0](s[i]) < f_max[1](s[i])) {
f_max.pop_front();
--z;
}
if (z >= 1) {
g[i] = f_max[0](s[i]);
to[kk][i] = f_max[0].i;
}
Line fi = Line{s[i], f[i] - s[i] * s[i], i};
while (z >= 2 && f_max[z - 2].intersects_earlier(fi, f_max[z - 1])) {
f_max.pop_back();
--z;
}
f_max.push_back(fi);
++z;
}
f.swap(g);
}
cout << f[n] << "\n";
vector<int> ans;
for (int i = n; k >= 0; i = to[k][i], --k) {
ans.push_back(i);
}
for (int i = ans.size() - 1; i >= 1; --i) {
cout << ans[i] << " ";
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
452 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
420 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
1 ms |
600 KB |
Integer 0 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
1116 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
4 ms |
1112 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
3 ms |
1116 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
1116 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
1116 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
604 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
860 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
32 ms |
8540 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
856 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
30 ms |
5468 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
36 ms |
6236 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
34 ms |
6748 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
23 ms |
5464 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
6268 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
42 ms |
7772 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
5844 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
15 ms |
6100 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
335 ms |
83660 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
6352 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
504 ms |
83560 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
333 ms |
59592 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
349 ms |
64204 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
259 ms |
53064 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
272 ms |
59860 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
353 ms |
75720 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
