// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
https://youtu.be/HnZKQJtGeHs (cht tutorial)
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
struct Line {
ll m, c, id, p;
ll get(ll x) {
return m * x + c;
}
ll intersect(Line li) {
ll x = ceil((ld) (c - li.c) / (li.m - m));
return x;
// ll x = ceil2(c - li.c, li.m - m);
// return x;
}
};
struct CHT {
deque<Line> dq;
void insert(Line li) {
while (!dq.empty()) {
ll x = dq.back().p;
ll old_val = dq.back().get(x);
ll new_val = li.get(x);
if (new_val >= old_val) {
dq.pop_back();
}
else {
break;
}
}
if (dq.empty()) {
li.p = 0;
dq.pb(li);
}
else {
li.p = li.intersect(dq.back());
dq.pb(li);
}
}
pll query(ll x) {
while (sz(dq) > 1) {
if (dq[1].get(x) >= dq[0].get(x)) {
dq.pop_front();
}
else {
break;
}
}
return {dq[0].get(x), dq[0].id};
}
};
void solve(int test_case)
{
ll n, k; cin >> n >> k;
k++;
vector<ll> a(n + 5);
rep1(i, n) cin >> a[i];
vector<ll> p(n + 5);
rep1(i, n) p[i] = p[i - 1] + a[i];
int par[n + 5][k + 5];
memset(par, -1, sizeof par);
vector<ll> dp1(n + 5, -inf2), dp2(n + 5, -inf2);
dp1[0] = 0;
rep1(t, k) {
fill(all(dp2), -inf2);
CHT cht;
rep1(i, n) {
ll m = p[i - 1];
ll c = (-p[i - 1] * p[n]) + dp1[i - 1];
cht.insert({m, c, i - 1, 0});
auto [mx, id] = cht.query(p[i]);
dp2[i] = mx + (p[i] * p[n]) - (p[i] * p[i]);
par[i][t] = id;
}
dp1 = dp2;
}
ll ans = dp1[n];
cout << ans << endl;
ll ptr = n;
vector<ll> cuts;
rev(t, k, 1) {
if (ptr != n) {
cuts.pb(ptr);
}
ptr = par[ptr][t];
}
reverse(all(cuts));
trav(x, cuts) cout << x << " ";
cout << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1052 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1172 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
596 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
56 ms |
8736 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
45 ms |
5716 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
49 ms |
6356 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
53 ms |
6868 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
37 ms |
5716 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
73 ms |
6484 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
62 ms |
8020 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
8272 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
8404 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
609 ms |
85756 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
8660 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
762 ms |
85732 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
522 ms |
61900 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
524 ms |
66220 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
433 ms |
55244 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
464 ms |
61980 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
612 ms |
77668 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
