#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int MAXN = 1e5+5;
//ll dp[MAXN][205];
vector<ll> new_dp(MAXN), dp(MAXN);
ll in[MAXN], pref[MAXN];
int cut[MAXN][205];
ll n, k;
void solve(int l, int r, int optl, int optr, int k)
{
if(l > r)
return;
int mid = (l + r) / 2;
pair<ll, ll> best = {-1e18, -1};
for(int i = optl; i <= min(mid, optr); i++)
{
best = max(best, {dp[i-1] + (pref[mid] - pref[i - 1]) * (pref[n] - pref[mid]), i});
}
new_dp[mid] = best.first;
int opt = best.second;
cut[mid][k] = opt;
solve(l, mid - 1, optl, opt, k);
solve(mid + 1, r, opt, optr, k); // From the monotonicity: opt(i, j) <= opt(i, j + 1); in which case opt is our point where we split our l, r range to get the sum most valuable. Since right side of the sum increase as we increase j, so opt side will also increase/stay the same compared with a lower j (to balance the sum between left side and right side) so opt(i, j) <= opt(i, j + 1) holds.
}
int main()
{
//ll n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> in[i];
pref[i] = pref[i - 1] + in[i];
//dp[i][0] = pref[i];
}
for(int i = 1; i <= k; i++)
{
solve(1, n-1, 1, n-1, i);
dp = new_dp;
}
ll ans = 0;
int curr = 0;
for(int i = 1; i <= n - 1; i++) {
ans = max(ans, dp[i]); // dp[i][k] maximum points by last splitting a range which ends with i.
if(ans == dp[i])
curr = i;
}
cout << ans << "\n";
vector<int> moves;
moves.push_back(curr);
for(int i = k; i > 1; i--)
{
moves.push_back(cut[curr][i] - 1);
curr = cut[curr][i] - 1;
}
reverse(moves.begin(), moves.end());
for(int e : moves)
cout << e << " ";
cout << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 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 |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
1888 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
1820 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 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 |
3 ms |
1876 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
1896 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
8 ms |
2004 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
2004 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
5 ms |
2004 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
7 ms |
2004 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
7 ms |
2004 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
2004 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
2012 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
2660 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
11 ms |
2664 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
2644 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
16 ms |
2720 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
13 ms |
2720 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
12 ms |
2644 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
11 ms |
2716 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
2644 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
6 ms |
2644 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
10068 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
6 ms |
10068 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
62 ms |
10112 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
8 ms |
10040 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
73 ms |
10076 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
79 ms |
9972 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
63 ms |
10104 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
45 ms |
10092 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
62 ms |
10096 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
89 ms |
10092 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
60 ms |
83712 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
56 ms |
83776 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
939 ms |
84172 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
70 ms |
84116 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1334 ms |
83860 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
896 ms |
83864 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
771 ms |
84172 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
612 ms |
84028 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
776 ms |
84016 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
981 ms |
84020 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |