#include <bits/stdc++.h>
template <class T>
using Vec = std::vector<T>;
using ll = long long;
constexpr ll INF = 1000000000000000000 + 5;
ll square(const ll x) {
return x * x;
}
struct Line {
ll a, b;
Line() = default;
ll eval(const ll x) const {
return a * x + b;
}
};
bool is_fixed(const Line &l, const Line &m, const Line &n) {
return __int128_t(m.b - l.b) * (m.a - n.a) < __int128_t(n.b - m.b) * (l.a - m.a);
}
int main() {
int N, K;
std::cin >> N >> K;
Vec<int> A(N);
for (auto &x: A) {
std::cin >> x;
}
Vec<int> cum(N + 1);
for (int i = 0; i < N; ++i) {
cum[i + 1] = cum[i] + A[i];
}
Vec<ll> dp(N + 1);
for (int i = 0; i <= N; ++i) {
dp[i] = square(cum[i]);
}
Vec<Vec<int>> index(K, Vec<int>(N + 1, -1));
for (int k = 0; k < K; ++k) {
Vec<Line> line(N + 1);
for (int i = 0; i <= N; ++i) {
line[i].a = -2 * cum[i];
line[i].b = dp[i] + square(cum[i]);
}
std::fill(dp.begin(), dp.end(), INF);
std::deque<int> active;
for (int i = 0; i <= N; ++i) {
if (!active.empty()) {
const ll x = cum[i];
while (active.size() >= 2) {
const auto &l = line[active[0]];
const auto &m = line[active[1]];
if (l.eval(x) >= m.eval(x)) {
active.pop_front();
}
else {
break;
}
}
index[k][i] = active[0];
dp[i] = line[active[0]].eval(x) + square(x);
}
while (active.size() >= 2) {
const auto &l = line[active[active.size() - 2]];
const auto &m = line[active[active.size() - 1]];
const auto &n = line[i];
if (is_fixed(l, m, n)) {
break;
}
else {
active.pop_back();
}
}
active.push_back(i);
}
}
std::cout << (square(cum[N]) - dp[N]) / 2 << '\n';
int i = N;
Vec<int> split(K);
for (int k = K - 1; k >= 0; --k) {
i = index[k][i];
split[k] = i;
}
for (int k = 0; k < K; ++k) {
std::cout << split[k] << " \n"[k + 1 == K];
}
return 0;
}
| # |
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 |
0 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 |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 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 |
0 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 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 |
0 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 |
0 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 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 |
2 ms |
492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1132 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1132 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1004 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1196 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
1132 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
620 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
748 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
748 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
74 ms |
8556 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
748 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
55 ms |
5376 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
60 ms |
6124 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
65 ms |
6508 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
49 ms |
5504 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
57 ms |
6124 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
71 ms |
7756 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
4836 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
33 ms |
4764 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
771 ms |
82276 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
41 ms |
4836 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
942 ms |
82276 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
640 ms |
58724 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
679 ms |
62564 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
520 ms |
51556 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
582 ms |
58696 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
741 ms |
74436 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
