#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
const ll oo = 3e18;
int n, k;
vector<ll> comp;
template <typename T>
bool chmax(T &a, T b) {
return (a < b) ? a = b, 1 : 0;
}
struct Line {
ll a, b, id;
Line() { a = 0; b = -oo; id = -1; }
Line(ll _a, ll _b, ll _id): a(_a), b(_b), id(_id) {}
ll operator()(ll x) { return a * x + b; }
};
struct Node {
Line line;
Node *left, *right;
Node() { left = right = nullptr; }
};
struct LCT {
Node *root;
LCT() { root = new Node; }
void update(Node* &node, ll l, ll r, Line line) {
if (l > r) return;
if (node == nullptr) node = new Node;
if (l == r) {
if (line(comp[l]) > node->line(comp[l])) node->line = line;
return;
}
ll m = (l + r) / 2;
if (line.a < node->line.a) swap(line, node->line);
if (line(comp[m]) > node->line(comp[m])) {
swap(line, node->line);
update(node->left, l, m, line);
}
else update(node->right, m + 1, r, line);
}
pair<ll,ll> get(Node* &node, ll l, ll r, ll x, ll i) {
if (l > r || node == nullptr) return {-oo, -1};
pair<ll,ll> cur = {node->line(x), node->line.id};
if (node->line.id >= i) cur = {-oo, -1};
if (l == r) return cur;
ll m = (l + r) / 2;
if (x < comp[m]) return max(cur, get(node->left, l, m, x, i));
else return max(cur, get(node->right, m + 1, r, x, i));
}
void update(Line line) {
update(root, 0, (int) comp.size() - 1, line);
}
pair<ll,ll> get(ll x, ll i) {
return get(root, 0, (int) comp.size() - 1, x, i);
}
void clear(Node* &node) {
if (node == nullptr) return;
clear(node->left);
clear(node->right);
delete node;
}
void clear() {
clear(root);
root = new Node;
}
};
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
vector<ll> a(n + 1), s(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
s[i] = a[i] + s[i - 1];
comp.push_back(s[i]);
}
sort(comp.begin(), comp.end());
comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
vector<LCT> lct(2);
vector<vector<int>> trace(n + 1, vector<int>(k + 1));
ll ans = 0;
for (int l = 0; l <= k; l++) {
lct[l % 2].clear();
for (int i = 1; i <= n; i++) {
ll tmp = 0;
if (l >= 1) tie(tmp, trace[i][l]) = lct[(l + 1) % 2].get(s[i], i);
lct[l % 2].update(Line(s[i], - (s[i] * s[i]) + tmp, i));
if (i == n && l == k) ans = tmp;
}
}
cout << ans << '\n';
for (int i = n, j = k; j >= 1; j--) {
i = trace[i][j];
cout << i << ' ';
}
cout << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
204 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 |
204 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 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 |
0 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 |
1 ms |
204 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
516 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
332 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
40 ms |
1344 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
38 ms |
1284 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
33 ms |
1164 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
44 ms |
1312 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
43 ms |
1228 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
8 ms |
684 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
15 ms |
716 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
2316 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
1612 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
497 ms |
10616 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
12 ms |
2764 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
270 ms |
7060 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
319 ms |
7472 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
355 ms |
8640 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
281 ms |
7492 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
322 ms |
7984 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
438 ms |
9796 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
91 ms |
20544 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
89 ms |
19960 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Execution timed out |
2071 ms |
103584 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
