#include <bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
using ll = long long;
// convex hull, maximum
struct LineContainer
{
struct Line
{
ll a, b;
int id;
};
vector<Line> lines;
int ptr;
bool bad_line(Line l1, Line l2, Line l3)
{
return (long double)(l1.b - l3.b) * (l2.a - l1.a) <= (long double)(l1.b - l2.b) * (l3.a - l1.a);
}
// Increasing a !
void add_line(ll a, ll b, int id)
{
Line l = {a, b, id};
if (SZ(lines) and lines.back().a == l.a)
{
if (lines.back().b >= l.b)
return ;
lines.pop_back();
}
while (SZ(lines) >= 2 and bad_line(lines[SZ(lines) - 2], lines.back(), l))
lines.pop_back();
lines.push_back(l);
}
inline ll get_val(Line l, ll x)
{
return x * l.a + l.b;
}
// Increasing x !
pair<ll, int> query(ll x)
{
assert(SZ(lines));
ptr = min(SZ(lines) - 1, ptr);
while (ptr + 1 < SZ(lines) and get_val(lines[ptr], x) <= get_val(lines[ptr+1], x))
++ptr;
return make_pair(get_val(lines[ptr], x), lines[ptr].id);
}
};
const int MAXN = 1e5+1;
const int MAXK = 201;
ll dp[2][MAXN];
ll arr[MAXN];
int transition[MAXK][MAXN];
LineContainer cht;
int nb_elem;
int main(void)
{
int nb_split;
cin >> nb_elem >> nb_split;
for (int i(0); i < nb_elem; ++i)
cin >> arr[i];
vector<ll> suffix_sum(nb_elem+1);
suffix_sum[nb_elem] = 0;
for (int i(nb_elem-1); i >= 0; --i)
suffix_sum[i] = suffix_sum[i+1] + arr[i];
for (int splits(1); splits <= nb_split; ++splits)
{
cht.lines.clear();
int cur = splits%2;
int prv = !cur;
dp[cur][nb_elem-1] = -1;
for (int id(nb_elem -2); id >= 0; --id)
{
if (dp[prv][id+1] >= 0)
cht.add_line(suffix_sum[id+1], dp[prv][id+1] - suffix_sum[id+1] * suffix_sum[id+1], id);
if (SZ(cht.lines))
{
auto [val, nxt] = cht.query(suffix_sum[id]);
dp[cur][id] = val;
transition[splits][id] = nxt;
}
else
dp[cur][id] = -1;
}
}
cout << dp[nb_split%2][0] << endl;
int cur(0);
for (int i(0); i < nb_split; ++i)
{
cur = transition[nb_split-i][cur] + 1;
cout << cur << ' ';
}
cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
308 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1088 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
1088 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
43 ms |
9716 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
1148 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
36 ms |
6200 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
39 ms |
7096 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
45 ms |
7540 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
31 ms |
6396 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
36 ms |
7164 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
43 ms |
8820 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
35 ms |
6632 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
37 ms |
6640 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
387 ms |
84320 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
50 ms |
7144 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
516 ms |
83940 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
342 ms |
60308 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
409 ms |
64740 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
290 ms |
53736 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
292 ms |
60648 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
374 ms |
76264 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
