#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const int MAXN = 1e5 + 5;
struct Line {
int id, cnt;
lint a, b;
Line() {}
Line(int id, int cnt, lint a, lint b) : id(id), cnt(cnt), a(a), b(b) {}
pair<lint, int> get(lint x) { return {a * x + b, cnt}; }
};
class ConvexHull {
public:
ConvexHull() {}
int sz, ptr = 0;
vector<Line> line;
void Clear() {
ptr = 0, line.clear();
}
bool Majorize(Line a, Line b, Line c) {
return make_tuple((1.00 * (c.b - a.b) / (a.a - c.a)), -c.cnt, c.id) <
make_tuple((1.00 * (b.b - a.b) / (a.a - b.a)), -b.cnt, b.id);
}
void Insert(Line n) {
sz = line.size();
if (!line.empty() && line.back().a == n.a) {
if (n.b < line.back().b) {
n = line.back();
}
line.pop_back();
}
while (ptr + 1 < sz && Majorize(line[sz - 2], line[sz - 1], n)) {
line.pop_back();
sz--;
}
line.emplace_back(n);
}
tuple<lint, int, int> Query(lint x) {
while (ptr + 1 < (int) line.size() && line[ptr].get(x) <= line[ptr + 1].get(x)) {
ptr++;
}
return make_tuple(line[ptr].get(x).first, line[ptr].cnt, line[ptr].id);
}
};
int N, K;
lint A[MAXN];
ConvexHull cht;
int prv[MAXN];
pair<lint, int> dp[MAXN];
void Trial(lint lambda, int sign) {
cht.Clear();
for (int i = 1; i <= N; i++) {
cht.Insert(Line(i - 1, dp[i - 1].second, A[i - 1], dp[i - 1].first - A[i - 1] * A[i - 1]));
lint x; int y, z;
tie(x, y, z) = cht.Query(A[i]);
dp[i] = make_pair(x - lambda, y + sign);
prv[i] = z;
}
}
vector<int> Trace(lint lambda, int sign) {
Trial(lambda, sign);
vector<int> res;
for (int cur = N; cur > 0; cur = prv[cur]) {
res.emplace_back(cur);
}
res.emplace_back(0);
reverse(begin(res), end(res));
return res;
}
void Answer(vector<int> res) {
lint ans = 0;
for (int i = 1; i < (int) res.size(); i++) {
ans += (A[res[i]] - A[res[i - 1]]) * A[res[i - 1]];
}
cout << ans << "\n";
for (int i = 1; i + 1 < (int) res.size(); i++) {
if (i > 1) {
cout << " ";
}
cout << res[i];
}
cout << "\n";
exit(0);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> N >> K; K++;
for (int i = 1; i <= N; i++) {
cin >> A[i];
A[i] += A[i - 1];
}
lint lo = 0, hi = 1e17;
while (lo < hi) {
lint md = (lo + hi) / 2;
Trial(md, -1);
if (-dp[N].second <= K) {
hi = md;
} else {
lo = md + 1;
}
}
auto minim = Trace(lo, -1);
auto maxim = Trace(lo, +1);
if (minim.size() == K + 1) Answer(minim);
if (maxim.size() == K + 1) Answer(maxim);
for (int i = 1, j = 0; i < (int) maxim.size(); i++) {
while (minim[j] <= maxim[i - 1]) {
j++;
}
if (minim[j] >= maxim[i] && i + (int) minim.size() - j == K + 1) {
vector<int> res;
for (int k = 0; k < i; k++) {
res.emplace_back(maxim[k]);
}
for (int k = j; k < (int) minim.size(); k++) {
res.emplace_back(minim[k]);
}
Answer(res);
}
}
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:121:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (minim.size() == K + 1) Answer(minim);
~~~~~~~~~~~~~^~~~~~~~
sequence.cpp:122:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (maxim.size() == K + 1) Answer(maxim);
~~~~~~~~~~~~~^~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
384 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 |
384 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
3 ms |
400 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
828 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
12 ms |
960 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
12 ms |
1216 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
11 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
14 ms |
960 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
14 ms |
960 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
15 ms |
1216 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
12 ms |
1216 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
13 ms |
1216 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
13 ms |
1216 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
130 ms |
4980 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
132 ms |
4976 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
106 ms |
6764 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
117 ms |
6772 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
140 ms |
6508 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
140 ms |
6508 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
148 ms |
6764 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
120 ms |
6636 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
122 ms |
6636 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
126 ms |
6764 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
