#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 1e5 + 10, maxk = 210;
const ll inf = 1e18;
int n, k;
ll a[maxn], pref[maxn], dp[2][maxn];
int bef[maxk][maxn];
void input()
{
cin >> n >> k;
k ++;
for (int i = 1; i <= n; i ++)
cin >> a[i];
}
void calculate_prefix()
{
for (int i = 1; i <= n; i ++)
pref[i] = pref[i - 1] + a[i];
}
ll get_range(int l, int r)
{
return pref[r] - pref[l - 1];
}
ll cost(int l, int r)
{
return pref[r] * pref[n] - pref[r] * pref[r] - pref[l - 1] * pref[n] + pref[l - 1] * pref[r];
}
void solve_layer(int layer, int left, int right, int optl, int optr)
{
///cout << layer << " " << left << " " << right << endl;
if (left > right)
return;
int opt = -1, mid = (left + right) / 2;
ll best = -inf;
for (int i = optl; i <= min(mid, optr); i ++)
{
ll sum = cost(i, mid) + dp[(layer + 1) % 2][i - 1];
if (sum > best)
{
best = sum;
opt = i;
}
}
if (opt == -1)
{
opt = 1;
}
bef[layer][mid] = opt - 1;
dp[layer % 2][mid] = best;
solve_layer(layer, left, mid - 1, optl, opt);
solve_layer(layer, mid + 1, right, opt, optr);
}
void calculate_states()
{
for (int j = 0; j <= 1; j ++)
for (int i = 0; i <= n; i ++)
dp[j][i] = -inf;
for (int i = 0; i <= n; i ++)
dp[0][i] = 0;
///cout << cost(1, 1) << endl;
for (int j = 1; j <= k; j ++)
solve_layer(j, j, n, j, n);
}
void print_answer()
{
cout << dp[k % 2 ][n] << endl;
int pos = n, part = k;
vector < int > path;
while(bef[part][pos] != 0)
{
pos = bef[part][pos];
part --;
path.push_back(pos);
}
reverse(path.begin(), path.end());
for (int v : path)
cout << v << " ";
cout << endl;
}
void solve()
{
input();
calculate_prefix();
calculate_states();
print_answer();
}
int main()
{
solve();
return 0;
}
/**
7 3
4 1 3 4 0 2 3
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
312 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1200 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
436 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1804 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
1764 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1620 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
1876 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1756 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
616 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
852 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
752 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
724 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
63 ms |
9364 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
852 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
74 ms |
5788 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
70 ms |
6736 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
62 ms |
7200 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
5920 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
61 ms |
6756 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
84 ms |
8404 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
36 ms |
5052 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
36 ms |
5136 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
620 ms |
82544 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
35 ms |
5492 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1264 ms |
82252 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
838 ms |
58776 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
655 ms |
62952 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
471 ms |
51872 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
654 ms |
58920 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
819 ms |
74680 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
