// In the name oF the God
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define halt(x) cout << x << '\n', exit(0)
using namespace std;
const int inf = 1e9 + 7;
const int mod = 998244353;
const int maxN = 1e5 + 5, maxK = 2e2 + 5;
int n, k, ps[maxN], dp[2][maxN];
int32_t opt[maxK][maxN];
int cost(int l, int r) {
return ps[l] * (ps[r] - ps[l]);
}
void optimize(int q, int l, int r, int optl, int optr) {
int mid = (r + l) >> 1, o;
for (int i = optl; i < min(mid, optr); i++) {
if (dp[1][mid] <= dp[0][i] + cost(i, mid)) {
dp[1][mid] = dp[0][i] + cost(i, mid);
o = i;
}
}
if (r - l == 1) {
opt[q][mid] = o;
return;
}
optimize(q, l, mid, optl, o + 1);
optimize(q, mid, r, o, optr);
}
void f(int pos, int q) {
if (!q) return;
cout << pos << ' ';
f(opt[q][pos], q - 1);
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k; k++;
for (int i = 1; i <= n; i++) {
cin >> ps[i]; ps[i] += ps[i-1];
}
for (int i = 0; i <= n; i++) dp[0][i] = dp[1][i] = -inf * inf;
dp[0][0] = 0;
for (int i = 1; i <= k; i++) {
optimize(i, i, n + 1, 0, n);
for (int i = 0; i <= n; i++) dp[0][i] = dp[1][i];
for (int i = 0; i <= n; i++) dp[1][i] = -inf * inf;
}
cout << dp[0][n] << '\n';
f(opt[k][n], k - 1);
cout << '\n';
return 0;
}
Compilation message
sequence.cpp: In function 'void optimize(long long int, long long int, long long int, long long int, long long int)':
sequence.cpp:38:13: warning: 'o' may be used uninitialized in this function [-Wmaybe-uninitialized]
38 | optimize(q, l, mid, optl, o + 1);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
23128 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
12636 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4564 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
82428 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
57864 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
8 ms |
74328 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
8 ms |
82524 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
20828 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
14684 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
25080 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
82524 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
82524 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
70212 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
82524 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
82720 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
18780 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
35164 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
52 ms |
82436 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
4696 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
50 ms |
52172 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
45 ms |
57680 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
57 ms |
61988 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
39 ms |
51548 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
43 ms |
57884 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
55 ms |
74240 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
4948 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
19 ms |
4892 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
472 ms |
82708 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
4700 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
788 ms |
82712 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
461 ms |
58460 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
572 ms |
62292 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
425 ms |
51988 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
409 ms |
58176 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
521 ms |
74544 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
