#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
typedef long long ll;
using namespace std;
const int maxn = 1e5 + 5, maxk = 205;
ll dp[2][maxn], pf[maxn];
int split[maxk][maxn];
int n, k;
inline ll sum(const int& l, const int& r)
{
return pf[r + 1] - pf[l];
}
void rek(int i, int l1, int l2, int r1, int r2)
// chceme zistit odpovede pre dp[i][l1] az dp[i][l2] ak optimalne splity musia lezat v intervale [r1, r2]
{
if (l1 > l2) return;
int mid = (l1 + l2) >> 1;
dp[i & 1][mid] = split[i][mid] = -1;
for (int j = max(r1, mid); j <= r2; j++)
{
ll val = sum(mid, j) * sum(j + 1, n - 1) + dp[(i & 1) ^ 1][j + 1];
if (val > dp[i & 1][mid])
{
dp[i&1][mid] = val;
split[i][mid] = j;
}
}
rek(i, l1, mid - 1, r1, split[i][mid]);
rek(i, mid + 1, l2, split[i][mid], r2);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 0, a; i < n; i++)
{
cin >> a;
pf[i + 1] = pf[i] + a;
}
for (int i = 1; i <= k; i++)
{
for (int j = 0; j < n; j++)
{
dp[i & 1][j] = 0;
}
rek(i, 0, n - 2, 0, n - 2);
}
cout << dp[k & 1][0] << "\n";
for (int i = k, j = 0; i > 0; i--)
{
j = split[i][j] + 1;
cout << j << " ";
}
cout << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
320 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
1328 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
9 ms |
1996 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
10 ms |
2000 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
9 ms |
1740 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
10 ms |
2100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
2008 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
972 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
588 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
4 ms |
588 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
87 ms |
9256 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
588 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
82 ms |
5788 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
83 ms |
6596 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
84 ms |
7108 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
58 ms |
5852 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
74 ms |
6660 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
93 ms |
8388 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
3780 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
33 ms |
3792 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
833 ms |
80836 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
31 ms |
3812 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1486 ms |
80916 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
929 ms |
57412 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
980 ms |
61372 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
615 ms |
50376 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
780 ms |
57648 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
992 ms |
73064 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |