#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int kx=2e2+5, nx=1e5+5;
int n, k;
ll dp[kx][nx], qs[nx];
int bk[kx][nx];
void solve(int l, int r, int optl, int optr, int layer)
{
if (l>r) return;
int md=(l+r)/2, c=layer%2, pv=1-c;
pair<ll, ll> p={LLONG_MAX, 0};
for (int i=optl; i<=min(optr, md-1); i++) if (dp[pv][i]!=LLONG_MAX) p=min(p, {dp[pv][i]+(qs[md]-qs[i])*(qs[md]-qs[i]), i});
dp[c][md]=p.first;
bk[layer][md]=p.second;
solve(l, md-1, optl, p.second, layer);
solve(md+1, r, p.second, optr, layer);
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k;
for (int i=1; i<=n; i++) cin>>qs[i], qs[i]+=qs[i-1];
for (int i=0; i<2; i++) for (int j=0; j<nx; j++) dp[i][j]=LLONG_MAX;
dp[0][0]=0;
for (int i=1; i<=k+1; i++)
{
for (int j=0; j<nx; j++) dp[i%2][j]=LLONG_MAX;
solve(1, n, 0, n, i);
}
cout<<(qs[n]*qs[n]-dp[(k+1)%2][n])/2<<'\n';
ll l=n, ly=k+1;
while (ly>1)
{
l=bk[ly][l];
ly--;
cout<<l<<' ';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
6744 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
6744 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
6 ms |
24924 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
14684 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
10584 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
23 ms |
84476 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
15 ms |
59740 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
20 ms |
76380 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
23 ms |
84572 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
22876 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
16732 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
7 ms |
27100 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
25 ms |
84572 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
28 ms |
84520 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
23 ms |
72028 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
26 ms |
84560 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
25 ms |
84564 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
21084 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
15 ms |
37852 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
6492 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
6492 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
84552 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
6488 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
76 ms |
53772 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
74 ms |
59896 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
78 ms |
64220 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
50 ms |
53748 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
70 ms |
59728 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
89 ms |
76368 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
6488 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
24 ms |
6992 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
626 ms |
84944 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
18 ms |
6884 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1226 ms |
84732 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
726 ms |
60116 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
641 ms |
64688 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
459 ms |
54152 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
620 ms |
60248 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
786 ms |
76608 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
