#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const long long inf = 1LL << 60;
int n, m, c, s[100009], sp[100009], ss[100009], d[100009], p[209][100009]; long long dp[100009], ndp[100009];
bool comp(long long xa, long long xb, long long ya, long long yb) {
// judge if xa * xb >= ya * yb
int xa1 = xa >> 31, xa0 = xa & ((1 << 31) - 1);
int xb1 = xb >> 31, xb0 = xb & ((1 << 31) - 1);
int ya1 = ya >> 31, ya0 = ya & ((1 << 31) - 1);
int yb1 = yb >> 31, yb0 = yb & ((1 << 31) - 1);
long long xc3 = 0;
long long xc2 = 1LL * xa1 * xb1;
long long xc1 = 1LL * xa1 * xb0 + 1LL * xa0 * xb1;
long long xc0 = 1LL * xa0 * xb0;
long long yc3 = 0;
long long yc2 = 1LL * ya1 * yb1;
long long yc1 = 1LL * ya1 * yb0 + 1LL * ya0 * yb1;
long long yc0 = 1LL * ya0 * yb0;
xc1 += xc0 >> 31; xc0 &= ((1 << 31) - 1);
xc2 += xc1 >> 31; xc1 &= ((1 << 31) - 1);
xc3 += xc2 >> 31; xc2 &= ((1 << 31) - 1);
yc1 += yc0 >> 31; yc0 &= ((1 << 31) - 1);
yc2 += yc1 >> 31; yc1 &= ((1 << 31) - 1);
yc3 += yc2 >> 31; yc2 &= ((1 << 31) - 1);
if (xc3 != yc3) return xc3 > yc3;
if (xc2 != yc2) return xc2 > yc2;
if (xc1 != yc1) return xc1 > yc1;
return xc0 >= yc0;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> ss[i + 1];
ss[i + 1] += ss[i];
}
int rn = 0;
for (int i = 0; i < n; i++) {
if (ss[i + 1] != ss[i]) {
s[++rn] = ss[i + 1];
sp[rn] = i + 1;
}
}
fill(dp + 1, dp + n + 1, inf);
for (int i = 0; i <= m && i < rn; ++i) {
c = 0;
for (int j = 0; j <= rn; ++j) {
while (c >= 2 && comp(s[j] - s[d[c - 1]], dp[d[c - 1]] - dp[d[c - 2]], s[d[c - 1]] - s[d[c - 2]], dp[j] - dp[d[c - 1]])) {
c--;
}
d[c++] = j;
}
int ptr = 0;
for (int j = 0; j <= rn; ++j) {
while (ptr + 1 != c && d[ptr + 1] < j && dp[d[ptr]] - 2LL * s[j] * s[d[ptr]] > dp[d[ptr + 1]] - 2LL * s[j] * s[d[ptr + 1]]) ptr++;
ndp[j] = dp[d[ptr]] + 2LL * (s[j] - s[d[ptr]]) * s[j];
p[i][j] = d[ptr];
}
copy(ndp, ndp + rn + 1, dp);
}
cout << 1LL * s[rn] * s[rn] - dp[rn] / 2 << '\n';
int pos = rn;
vector<int> ret;
for (int i = min(m, rn - 1); i >= 1; --i) {
pos = p[i][pos];
ret.push_back(sp[pos]);
}
for (int i = 1; i <= n; i++) {
if (ss[i] == ss[i - 1] && ret.size() != m) {
ret.push_back(i);
}
}
for (int i = 0; i < ret.size(); i++) {
cout << ret[i];
if (i + 1 == ret.size()) cout << '\n';
else cout << ' ';
}
return 0;
}
Compilation message
sequence.cpp: In function 'bool comp(long long int, long long int, long long int, long long int)':
sequence.cpp:9:44: warning: integer overflow in expression [-Woverflow]
int xa1 = xa >> 31, xa0 = xa & ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:10:44: warning: integer overflow in expression [-Woverflow]
int xb1 = xb >> 31, xb0 = xb & ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:11:44: warning: integer overflow in expression [-Woverflow]
int ya1 = ya >> 31, ya0 = ya & ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:12:44: warning: integer overflow in expression [-Woverflow]
int yb1 = yb >> 31, yb0 = yb & ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:21:38: warning: integer overflow in expression [-Woverflow]
xc1 += xc0 >> 31; xc0 &= ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:22:38: warning: integer overflow in expression [-Woverflow]
xc2 += xc1 >> 31; xc1 &= ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:23:38: warning: integer overflow in expression [-Woverflow]
xc3 += xc2 >> 31; xc2 &= ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:24:38: warning: integer overflow in expression [-Woverflow]
yc1 += yc0 >> 31; yc0 &= ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:25:38: warning: integer overflow in expression [-Woverflow]
yc2 += yc1 >> 31; yc1 &= ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp:26:38: warning: integer overflow in expression [-Woverflow]
yc3 += yc2 >> 31; yc2 &= ((1 << 31) - 1);
~~~~~~~~~~^~~
sequence.cpp: In function 'int main()':
sequence.cpp:72:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (ss[i] == ss[i - 1] && ret.size() != m) {
~~~~~~~~~~~^~~~
sequence.cpp:76:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < ret.size(); i++) {
~~^~~~~~~~~~~~
sequence.cpp:78:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (i + 1 == ret.size()) cout << '\n';
~~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
432 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
432 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
432 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
496 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
496 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
540 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
900 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
900 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
900 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
900 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
952 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1848 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1848 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1848 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1848 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1860 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1860 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1860 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1860 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1860 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1860 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2508 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2508 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
2508 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
2508 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2508 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2532 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
2532 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2532 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2532 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2532 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
60 ms |
9948 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
9948 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
38 ms |
9948 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
46 ms |
9948 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
76 ms |
9948 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
43 ms |
9948 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
50 ms |
9948 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
62 ms |
9948 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
9948 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
21 ms |
9948 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
580 ms |
83544 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
83544 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
595 ms |
83544 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
412 ms |
83544 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
578 ms |
83544 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
428 ms |
83544 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
461 ms |
83544 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
579 ms |
83544 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
