#include <bits/stdc++.h>
using namespace std;
void just_do_it();
int main() {
#ifdef KAMIRULEZ
freopen("kamirulez.inp", "r", stdin);
freopen("kamirulez.out", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
just_do_it();
return 0;
}
const long long inf = 1e18L + 20;
const int maxN = 1e5 + 20;
const int maxK = 2e2 + 20;
int a[maxN];
long long pref[maxN];
long long cur_dp[maxN];
long long nxt_dp[maxN];
int best[maxN][maxK];
struct line {
long long a = 0;
long long b = 0;
line() {};
line(long long _a, long long _b): a(_a), b(_b) {};
long long eval(long long x) {
return a * x + b;
};
};
long long floor_div(long long x, long long y) {
return (x / y) - ((x ^ y) < 0 && x % y);
}
long long inter(line L1, line L2) {
return floor_div(L2.b - L1.b, L1.a - L2.a);
}
struct cht {
vector<pair<int, line>> Q;
int pt = 0;
void clear() {
Q.clear();
pt = 0;
}
void add(int id, line L) {
while ((int)Q.size() >= 2) {
if (Q.back().second.a == L.a) {
if (Q.back().second.b >= L.b) {
return;
}
else {
Q.pop_back();
}
}
else if (inter(Q.end()[-2].second, Q.back().second) >= inter(Q.back().second, L)) {
Q.pop_back();
}
else {
break;
}
}
if (!Q.empty()) {
if (Q.back().second.a == L.a) {
if (Q.back().second.b >= L.b) {
return;
}
else {
Q.pop_back();
}
}
}
Q.emplace_back(id, L);
}
pair<int, long long> get(long long x) {
assert(!Q.empty());
pt = min(pt, (int)Q.size() - 1);
while (pt < (int)Q.size() - 1 && Q[pt].second.eval(x) < Q[pt + 1].second.eval(x)) {
pt++;
}
return make_pair(Q[pt].first, Q[pt].second.eval(x));
}
} CHT;
void just_do_it() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
CHT.add(0, line(0, 0));
for (int j = 1; j <= K + 1; j++) {
for (int i = 1; i <= N; i++) {
if (j <= i) {
auto p = CHT.get(pref[i]);
best[i][j] = p.first;
nxt_dp[i] = p.second + pref[i] * (pref[N] - pref[i]);
}
if (j > 0 && j - 1 <= i) {
CHT.add(i, line(pref[i], cur_dp[i] - pref[i] * pref[N]));
}
}
swap(cur_dp, nxt_dp);
CHT.clear();
}
cout << cur_dp[N] << '\n';
int cur = N;
for (int i = K + 1; i >= 2; i--) {
cout << (cur = best[cur][i]) << " ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1832 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
1892 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
1944 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
17 ms |
2004 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
12 ms |
2096 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
15 ms |
2004 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
19 ms |
2004 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
8 ms |
2092 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
6 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
2096 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2772 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2772 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
19 ms |
2772 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2772 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
25 ms |
2828 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
19 ms |
2828 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
28 ms |
2772 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
19 ms |
2836 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
2824 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
2836 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
10900 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
10900 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
62 ms |
11156 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
11124 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
44 ms |
10900 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
47 ms |
10896 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
51 ms |
11156 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
38 ms |
11136 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
43 ms |
11156 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
53 ms |
11156 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
92320 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
49 ms |
92568 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
575 ms |
93004 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
50 ms |
92836 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
583 ms |
92504 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
451 ms |
92504 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
483 ms |
92692 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
398 ms |
92688 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
404 ms |
92608 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
491 ms |
92736 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
