#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
const int K=205;
int n,k,a[N],opt[K][N];
ll s[N],dp[2][N];
void calc(int lev,int l,int r,int L,int R)
{
if(l>r) return ;
int mid=(l+r)/2;
dp[1][mid]=1e18;
for(int i=L;i<=min(mid-1,R);i++)
{
if(dp[1][mid]>dp[0][i]+(s[mid]-s[i])*(s[mid]-s[i]))
{
dp[1][mid]=dp[0][i]+(s[mid]-s[i])*(s[mid]-s[i]);
opt[lev][mid]=i;
}
}
calc(lev,l,mid-1,L,opt[lev][mid]);
calc(lev,mid+1,r,opt[lev][mid],R);
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n>>k;
k++;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
ll res=s[n]*s[n];
dp[0][0]=1e18;
dp[1][0]=1e18;
for(int i=1;i<=n;i++)
{
dp[0][i]=s[i]*s[i];
opt[1][i]=i;
}
for(int lev=2;lev<=k;lev++)
{
calc(lev,1,n,0,n-1);
for(int j=0;j<=n;j++) dp[0][j]=dp[1][j];
}
res-=dp[0][n];
cout<<res/2<<'\n';
int cur=n;
while(k>1)
{
cur=opt[k][cur];
k--;
cout<<cur<<' ';
}
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp:27:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
27 | main()
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
384 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 |
404 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
66 ms |
9336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
79 ms |
6016 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
74 ms |
6780 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
68 ms |
7288 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
47 ms |
6008 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
69 ms |
6776 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
86 ms |
8444 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
4600 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
4704 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
715 ms |
81752 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
4608 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1473 ms |
81848 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
884 ms |
58404 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
746 ms |
62200 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
521 ms |
51192 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
724 ms |
58320 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
926 ms |
73976 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
