#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ar array
const int INF = LLONG_MAX;
const int MOD = 1e9+7;
const int MXN = 1e5+9, MXK = 205;
int dp[2][MXN]; int32_t par[MXK][MXN];
struct CHT {
struct Line {
int m, c, index;
Line(int _m, int _c, int _index) : m(_m), c(_c), index(_index) {}
ld intersect(Line other) { return (ld) (c - other.c)/(other.m - m); }
int at(int x) { return m*x + c; }
};
deque<Line> dq;
void add(int m, int c, int index) {
Line newLine(m, c, index);
while (dq.size() >= 2 && dq[1].intersect(newLine) >= dq[1].intersect(dq[0])) {
dq.pop_front();
}
dq.push_front(newLine);
}
ar<int,2> query(int x) {
// {m*x + c, index}
while (dq.size() >= 2 && end(dq)[-1].at(x) <= end(dq)[-2].at(x)) {
dq.pop_back();
}
return {dq.back().at(x), dq.back().index};
}
};
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k; cin>>n>>k;
vector<int> v(n);
for (int &i : v) cin>>i;
vector<int> pf(n);
partial_sum(v.begin(), v.end(), pf.begin());
auto sum = [&](int l, int r) {
return pf[r] - (l-1 >= 0 ? pf[l-1] : 0);
};
for (int i = 1; i <= k; i++) {
int I = i&1;
CHT cht;
cht.add(0, 0, 0);
for (int j = 1; j < n; j++) {
// for (int a = 0; a < j; a++) {
// if (dp[I][j] < dp[I^1][a] + sum(a, j-1)*sum(j, n-1)) {
// dp[I][j] = dp[I^1][a] + sum(a, j-1)*sum(j, n-1);
// par[i][j] = a;
// }
// }
ar<int,2> qry = cht.query(sum(j, n-1));
dp[I][j] = qry[0] + pf[j-1]*sum(j, n-1);
par[i][j] = qry[1];
cht.add(-pf[j-1], dp[I^1][j], j);
}
}
int ans = -INF, x = -1;
for (int j = 1; j < n; j++) {
if (dp[k&1][j] > ans) {
ans = dp[k&1][j]; x = j;
}
}
cout<<ans<<"\n";
vector<int> bruh;
for (int i = k; i > 0; i--) {
bruh.push_back(x);
x = par[i][x];
}
for (int i = bruh.size()-1; i >= 0; --i) cout<<bruh[i]<<" ";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
364 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 |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
364 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 |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
3 ms |
1644 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
1516 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
2156 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
10 ms |
2156 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
8 ms |
1900 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
6 ms |
1132 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
1004 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
75 ms |
9580 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
54 ms |
6068 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
63 ms |
6892 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
72 ms |
7404 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
51 ms |
6124 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
66 ms |
6892 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
86 ms |
8684 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
5264 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
26 ms |
5868 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
792 ms |
82596 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
27 ms |
6380 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
904 ms |
82212 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
638 ms |
58588 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
660 ms |
62892 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
526 ms |
51832 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
641 ms |
58828 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
769 ms |
74520 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |