#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;
int N, K, a[100001];
ll pref[100001] = {0};
ll dp[2][100001] = {0};
int last_split[202][100001];
int cht[100001], fr = 0, bk = -1;
#define m(j) (pref[j])
#define c(j) (dp[0][j]-pref[j]*pref[N])
inline ld isect(const int &a, const int &b)
{
return (ld)(c(b) - c(a)) / (ld)(m(a) - m(b));
}
inline bool bad(const int &x, const int &y, const int &z)
{
return isect(z, y) <= isect(z, x);
}
inline ll eval(const int &i, const ll &x)
{
return m(i) * x + c(i);
}
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++)
{
while (fr < bk && bad(cht[bk-1], cht[bk], i-1))
bk--;
cht[++bk] = i-1;
while (fr < bk && eval(cht[fr], pref[i]) <= eval(cht[fr+1], pref[i]))
fr++;
dp[1][i] = eval(cht[fr], pref[i]) + pref[i] * (pref[N] - pref[i]);
last_split[k][i] = cht[fr];
}
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 |
3 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
1812 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
1844 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
1880 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
2004 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
23 ms |
2112 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
7 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
13 ms |
2004 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
7 ms |
1924 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
7 ms |
1940 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
1808 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
90 ms |
2948 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
65 ms |
2584 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
81 ms |
2828 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
89 ms |
2916 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
20 ms |
2128 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
13 ms |
2044 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
26 ms |
2120 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1876 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
94 ms |
3492 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
94 ms |
3504 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
82 ms |
3304 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
95 ms |
3508 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
94 ms |
3512 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
20 ms |
2212 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
38 ms |
2536 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
137 ms |
10684 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
87 ms |
7192 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
100 ms |
8048 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
104 ms |
8568 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
89 ms |
7392 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
97 ms |
8200 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
121 ms |
9840 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
4564 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
16 ms |
4700 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
457 ms |
82124 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
15 ms |
5076 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
649 ms |
81860 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
447 ms |
58440 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
470 ms |
62520 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
312 ms |
51596 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
365 ms |
58524 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
452 ms |
74200 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
