#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct Line
{
ll m, c;
int idx;
Line() : m(0LL), c(0LL), idx(0) {}
Line(ll _m, ll _c, int _idx) : m(_m), c(_c), idx(_idx) {}
ll operator()(const ll &x) { return m * x + c; }
friend ld isect(const Line &a, const Line &b)
{
return (ld)(b.c - a.c) / (ld)(a.m - b.m);
}
};
int N, K, a[100001];
ll pref[100001] = {0};
ll dp[2][100001] = {0};
int last_split[202][100001];
Line cht[100001];
int fr = 0, bk = -1;
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin >> N >> K;
for (int i = 1; i <= N; i++)
{
cin >> a[i];
pref[i] = pref[i-1] + a[i];
}
for (int i = 0; i <= N; i++)
dp[0][i] = pref[i] * (pref[N] - pref[i]);
for (int k = 2; k <= K + 1; k++)
{
fr = 0, bk = -1;
for (int i = k; i <= N; i++)
{
Line newline(pref[i-1], dp[0][i-1] - pref[i-1] * pref[N], i-1);
while (fr < bk && isect(cht[bk], newline) <= isect(cht[bk-1], newline))
bk--;
cht[++bk] = newline;
while (fr < bk && cht[fr](pref[i]) <= cht[fr+1](pref[i]))
fr++;
dp[1][i] = cht[fr](pref[i]) + pref[i] * (pref[N] - pref[i]);
last_split[k][i] = cht[fr].idx;
}
swap(dp[0], dp[1]);
}
cout << dp[0][N] << '\n';
int i = N;
do
{
i = last_split[K+1][i];
cout << i << ' ';
}
while (--K);
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
4276 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
6 ms |
4180 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
4180 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
4308 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
4180 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
25 ms |
4436 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
6 ms |
4276 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
4180 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
13 ms |
4320 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
7 ms |
4180 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
7 ms |
4160 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
8 ms |
4308 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4256 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
91 ms |
5228 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
4180 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
65 ms |
4948 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
81 ms |
5168 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
96 ms |
5180 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
23 ms |
4436 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
15 ms |
4308 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
27 ms |
4428 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
92 ms |
5812 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
4180 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
97 ms |
5884 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
80 ms |
5576 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
95 ms |
5848 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
92 ms |
5860 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
21 ms |
4596 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
39 ms |
4872 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
4436 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
4440 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
119 ms |
12940 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
4564 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
83 ms |
9496 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
94 ms |
10444 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
98 ms |
10880 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
77 ms |
9576 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
93 ms |
10524 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
113 ms |
12084 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
6484 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
14 ms |
6556 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
372 ms |
83716 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
14 ms |
6612 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
551 ms |
83756 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
381 ms |
60172 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
369 ms |
64120 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
276 ms |
53180 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
313 ms |
60104 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
397 ms |
75844 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
