#include "bits/stdc++.h"
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int K = 202;
const int N = 1e5 + 5;
int a[N];
int last[K][N];
int pref[N], suf[N];
long long dp[N], dp2[N];
struct Line {
int m;
long long b;
Line(int m_, long long b_) : m(m_), b(b_) {}
long long val(int x) {
return (long long) m * x + b;
}
long double intersection(Line l) {
assert(l.m != m);
return (b - l.b) / (l.m - m);
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
pref[i] = pref[i - 1] + a[i];
}
for (int i = n; i >= 1; --i) {
suf[i] = suf[i + 1] + a[i];
}
int ind = 0;
long long ans = -LLONG_MAX;
for (int j = 1; j <= k; ++j) {
deque<pair<Line, int>> vec;
vec.emplace_back(Line(-pref[j - 1], dp[j - 1]), j - 1);
for (int i = j; i < n; ++i) {
if (a[i] == 0) {
dp2[i] = dp2[i - 1];
last[j][i] = (last[j][i - 1] ? last[j][i - 1] : i - 1);
continue;
}
while (vec.size() >= 2) {
if (vec[0].first.val(suf[i + 1]) <= vec[1].first.val(suf[i + 1])) {
vec.pop_front();
} else {
break;
}
}
dp2[i] = (long long) pref[i] * suf[i + 1] + vec.front().first.val(suf[i + 1]);
last[j][i] = vec.front().second;
Line cur = Line(-pref[i], dp[i]);
while (vec.size() >= 2) {
int m = (int) vec.size();
if (cur.intersection(vec[m - 1].first) >= vec[m - 2].first.intersection(vec[m - 1].first)) {
vec.pop_back();
} else {
break;
}
}
vec.emplace_back(cur, i);
}
for (int i = 1; i <= n; ++i) {
dp[i] = dp2[i];
if (j == k && dp[i] > ans) {
ind = i;
ans = dp[i];
}
}
}
cout << ans << '\n';
vector<int> path;
int cnt = k;
while (cnt) {
assert(ind);
path.push_back(ind);
ind = last[cnt--][ind];
}
reverse(path.begin(), path.end());
for (int i : path) {
cout << i << ' ';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
2396 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 |
2396 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
2396 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 |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
20828 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
10584 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
16 ms |
78424 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
37468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
60008 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
9 ms |
78428 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
16732 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
10704 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
22876 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
15 ms |
78452 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
62632 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
59996 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
78436 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
76380 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
14684 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
33116 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2908 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
2908 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
81 ms |
78676 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
2908 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
37 ms |
44328 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
46 ms |
48864 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
62 ms |
60244 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
42 ms |
48208 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
45 ms |
52584 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
61 ms |
68948 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
5976 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
13 ms |
6236 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
584 ms |
81816 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
6236 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
578 ms |
81932 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
427 ms |
58588 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
519 ms |
62860 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
402 ms |
52436 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
402 ms |
58724 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
512 ms |
74832 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
