#include <iostream>
#include <deque>
#include <algorithm>
#include <cstring>
using namespace std;
// l[n] is bad if l[n - 1] intersects l[n + 1] before l[n] does
// => l[0] is bad if l[1] intersects l[-1] before l[0] does
using ll = long long;
const int N = 1e5;
const int K = 200;
int n, k, par[K + 5][N + 5];
ll a[N + 5], pfx_sum[N + 5], dp[N + 5];
deque<int> l;
ll ps(int i) {
return pfx_sum[i];
}
ll ss(int i) {
return pfx_sum[n] - pfx_sum[i - 1];
}
ll f(int li, ll x) {
return -ps(li) * x + dp[li];
}
bool firstIsBad(int l1, int l2, int l0) {
ll m1 = -ps(l1), c1 = dp[l1];
ll m2 = -ps(l2), c2 = dp[l2];
ll m0 = -ps(l0), c0 = dp[l0];
return (c2 - c0) * (m0 - m1) >= (c1 - c0) * (m0 - m2); // ((c2 - c0) / (m0 - m2)) > ((c1 - c0) / (m0 - m1))
}
void dfs(int i, int s) {
cout << i << ' ';
if (s > 1) dfs(par[s][i], s - 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
a[0] = pfx_sum[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pfx_sum[i] = a[i] + pfx_sum[i - 1];
}
memset(par, -1, sizeof par);
for (int s = 1; s <= k; s++) {
deque<int> l_new;
for (int i = n; i >= 1; i--) {
dp[i] = -1;
while (l.size() > 1 and (i <= l[0] or f(l[0], ss(i + 1)) <= f(l[1], ss(i + 1)))) l.pop_front();
if (s == 1) dp[i] = ps(i) * ss(i + 1);
else if (not l.empty() and l[0] < i) {
dp[i] = ps(i) * ss(i + 1) + f(l[0], ss(i + 1));
par[s][i] = l[0];
}
if (dp[i] == -1) continue;
while (l_new.size() > 1 and firstIsBad(l_new[0], l_new[1], i)) l_new.pop_front();
l_new.push_front(i);
}
reverse(l_new.begin(), l_new.end());
l = l_new;
}
ll ans = 1;
for (int i = 1; i <= n; i++) {
if (dp[ans] < dp[i]) ans = i;
}
cout << dp[ans] << '\n';
dfs(ans, k);
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
80456 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
32 ms |
80500 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
34 ms |
80460 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
35 ms |
80496 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
32 ms |
80460 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
38 ms |
80468 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
32 ms |
80532 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
35 ms |
80460 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
32 ms |
80460 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
32 ms |
80516 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
33 ms |
80468 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
32 ms |
80596 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
33 ms |
80532 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
31 ms |
80564 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
33 ms |
80448 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
32 ms |
80460 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
32 ms |
80432 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
80512 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
46 ms |
80624 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
43 ms |
80448 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
43 ms |
80468 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
45 ms |
80520 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
48 ms |
80556 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
43 ms |
80460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
46 ms |
80444 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
42 ms |
80504 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
43 ms |
80452 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
80460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
31 ms |
80480 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
36 ms |
80512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
32 ms |
80504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
32 ms |
80520 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
34 ms |
80468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
35 ms |
80500 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
39 ms |
80516 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
33 ms |
80480 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
34 ms |
80444 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
80528 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
32 ms |
80472 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
41 ms |
80600 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
38 ms |
80568 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
44 ms |
80576 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
39 ms |
80568 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
40 ms |
80600 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
37 ms |
80512 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
36 ms |
80588 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
37 ms |
80588 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
80848 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
35 ms |
80768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
79 ms |
80844 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
37 ms |
80840 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
76 ms |
80804 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
71 ms |
80868 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
82 ms |
80876 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
62 ms |
80876 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
69 ms |
80872 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
84 ms |
80872 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
83532 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
48 ms |
83536 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
481 ms |
83728 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
47 ms |
83776 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
720 ms |
83552 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
446 ms |
83560 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
472 ms |
84196 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
369 ms |
84172 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
360 ms |
84140 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
477 ms |
84036 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
