#include<bits/stdc++.h>
using namespace std;
const int N=1e5+2;
const int K=201;
int n,pre[K][N];
long long dp[2][N],sum[N];
stack<int> lis;
void solve(int idx,int l,int r,int lef,int rig){
if(lef>rig){
return;
}
int i,mid=(lef+rig)>>1;
long long max1=-1;
for(i=min(mid-1,r);i>=l;i--){
if(max1<dp[(idx+1)&1][i]+(sum[mid]-sum[i])*(sum[n]-sum[mid])){
max1=dp[(idx+1)&1][i]+(sum[mid]-sum[i])*(sum[n]-sum[mid]);
pre[idx][mid]=i;
}
}
dp[idx&1][mid]=max1;
solve(idx,l,pre[idx][mid],lef,mid-1);
solve(idx,pre[idx][mid],r,mid+1,rig);
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int i,j,k,num;
cin>>n>>num;
for(i=1;i<=n;i++){
cin>>j;
sum[i]=sum[i-1]+j;
}
for(i=1;i<=n;i++){
dp[1][i]=(sum[n]-sum[i])*sum[i];
pre[1][i]=i;
}
for(i=2;i<=num;i++){
solve(i,i-1,n-1,i,n-1);
}
j=n-1;
for(i=num;i<n;i++){
if(dp[num&1][j]<dp[num&1][i]){
j=i;
}
}
cout<<dp[num&1][j]<<'\n';
for(i=num;i>0;i--){
lis.push(j);
j=pre[i][j];
}
while(lis.size()){
cout<<lis.top()<<' ';
lis.pop();
}
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:27:10: warning: unused variable 'k' [-Wunused-variable]
int i,j,k,num;
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
604 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
2040 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
11 ms |
2040 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
10 ms |
1784 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
10 ms |
2040 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
2040 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
6 ms |
1016 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
66 ms |
9456 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
75 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
72 ms |
6748 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
67 ms |
7160 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
49 ms |
5948 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
66 ms |
6764 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
85 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
4088 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
27 ms |
4092 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
694 ms |
81440 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
22 ms |
4344 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1378 ms |
81132 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
834 ms |
57640 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
735 ms |
61688 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
535 ms |
50436 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
695 ms |
57548 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
893 ms |
73264 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |