#include <bits/stdc++.h>
template <class X, class Y>
bool cmax(X &a, const Y &b) {
return a < b ? a = b, 1 : 0;
}
using namespace std;
using ll = long long;
const int N = 100005, K = 205;
ll S[N], Dp[2][N];
int Opt[K][N];
void Dnc(int k, int l, int r, int optl, int optr) {
int m = (l + r) / 2;
for (int i = optl; i <= min(m, optr); i++)
if (cmax(Dp[k & 1][m], Dp[~k & 1][i - 1] +
S[i - 1] * (S[m] - S[i - 1]))) Opt[k][m] = i;
if (l < m) Dnc(k, l, m - 1, optl, Opt[k][m]);
if (m < r) Dnc(k, m + 1, r, Opt[k][m], optr);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> S[i]; S[i] += S[i - 1];
}
for (int i = 1; i <= k; i++) {
memset(Dp[i & 1], 0xc0, sizeof Dp[i & 1]);
Dnc(i, i + 1, n, i + 1, n);
}
cout << Dp[k & 1][n] << '\n';
stack <int> st;
while (k)
cout << (n = Opt[k--][n] - 1) << ' ';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1132 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
1900 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
2156 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
2028 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
8 ms |
2924 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
2668 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
10 ms |
2796 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
9 ms |
2924 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
2156 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
2068 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
2284 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
3564 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1900 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
19 ms |
3692 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
15 ms |
3308 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
3564 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
3564 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
2284 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
2668 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2156 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2156 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
64 ms |
10732 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
2156 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
83 ms |
7276 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
75 ms |
8172 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
68 ms |
8556 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
50 ms |
7404 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
85 ms |
8172 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
93 ms |
9876 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
3820 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
29 ms |
4076 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
624 ms |
81516 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
4460 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1419 ms |
81324 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
842 ms |
57836 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
706 ms |
62160 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
480 ms |
50796 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
699 ms |
57836 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
902 ms |
73580 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
