#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define eb emplace_back
#define ep emplace
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)v.size()
#define rmin(r, x) r = min(r, x)
#define rmax(r, x) r = max(r, x)
#define ends ' '
#define endl '\n'
#define rep(i, s, e) for(int i = (s); i <= (e); ++i)
#define rep2(i, e, s) for(int i = (e); i >= (s); --i)
#define print(v) copy(all(v), ostream_iterator<int>(cout, " ")), cout << endl
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
// #define LOCAL
const ll inf = 2e18;
const int maxn = 1e5 + 10;
const int maxk = 2e2 + 10;
const ll minx = 0, maxx = 1e9 + 10;
int N, K;
ll S[maxn];
pll D[maxk][maxn];
struct Line {
ll a, b;
int prv;
Line(ll a=0, ll b=-inf, int prv=-1) : a(a), b(b), prv(prv) {}
ll calc(ll x) { return a * x + b; }
};
struct Node {
Line f;
int l, r;
Node() : l(0), r(r) {}
};
struct Lichao {
Node tr[maxn];
int C;
Lichao() : C(1) {
rep(i, 0, maxn-1) tr[i] = Node();
}
void update(Line g, int nd=1, ll st=minx, ll ed=maxx) {
while(true) {
Line& f = tr[nd].f;
ll mid = st+ed >> 1;
if(f.calc(mid) < g.calc(mid)) swap(f, g);
if(f.calc(st) < g.calc(st)) {
ed = mid-1;
nd = tr[nd].l = (tr[nd].l ?: ++C);
}
else if(f.calc(ed) < g.calc(ed)) {
st = mid+1;
nd = tr[nd].r = (tr[nd].r ?: ++C);
}
else break;
}
}
pll query(ll x, int nd=1, ll st=minx, ll ed=maxx) {
pll ret = {-inf, -1};
while(nd) {
ll mid = st+ed >> 1;
rmax(ret, pll(tr[nd].f.calc(x), tr[nd].f.prv));
if(x <= mid) {
ed = mid-1;
nd = tr[nd].l;
}
else {
st = mid+1;
nd = tr[nd].r;
}
}
return ret;
}
};
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
cin >> N >> K;
rep(i, 1, N) {
int x; cin >> x;
S[i] = S[i-1] + x;
}
rep(i, 1, N) D[0][i] = pll(0, i);
rep(k, 1, K) {
Lichao T;
rep(i, 1, N) {
D[k][i] = T.query(S[i]);
T.update(Line(S[i], D[k-1][i].fi - S[i]*S[i], i));
}
}
vector<int> ans;
int idx = N;
rep2(k, K, 1) {
idx = D[k][idx].se;
ans.eb(idx);
}
reverse(all(ans));
cout << D[K][N].fi << endl;
for(auto& i : ans) cout << i << ends;
return 0;
}
Compilation message
sequence.cpp: In constructor 'Node::Node()':
sequence.cpp:46:2: warning: 'Node::r' is initialized with itself [-Winit-self]
46 | Node() : l(0), r(r) {}
| ^~~~
sequence.cpp: In member function 'void Lichao::update(Line, int, ll, ll)':
sequence.cpp:58:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
58 | ll mid = st+ed >> 1;
| ~~^~~
sequence.cpp: In member function 'pll Lichao::query(ll, int, ll, ll)':
sequence.cpp:74:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
74 | ll mid = st+ed >> 1;
| ~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
3412 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
14 ms |
3796 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 ms |
3412 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
3488 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
9 ms |
3540 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
3412 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
3412 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
6 ms |
3540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
56 ms |
5428 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
40 ms |
4812 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
54 ms |
5288 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
62 ms |
5532 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
16 ms |
3904 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
9 ms |
3680 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
18 ms |
3976 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
3540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
83 ms |
7904 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
3540 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
93 ms |
7912 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
84 ms |
7372 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
82 ms |
7948 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
92 ms |
7908 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
20 ms |
4336 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
36 ms |
5200 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
4180 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
4180 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
435 ms |
36312 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
4180 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
325 ms |
23252 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
355 ms |
26528 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
320 ms |
28124 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
310 ms |
23640 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
288 ms |
26444 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
368 ms |
33292 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
80 ms |
10472 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
84 ms |
10404 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
1436 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
