#include <bits/stdc++.h>
using namespace std;
const int MN=1e5+10;
long long dp[2][MN];
int a[MN];
long long ps[MN];
int dp2[201][MN];
long long sq(int x){
return 1ll*x*x;
}
void solve(int d,int l,int r,int ol,int orr){
int d1=d%2;
if(l>=r){
return ;
}
int mid=(l+r)/2;
dp2[d][mid]=ol;
dp[d1][mid]=0;
for(int i=ol;i<orr && i<mid;i++){
long long tmp=dp[d1^1][i]+1ll*(ps[mid+1]-ps[i+1])*ps[i+1];
if(dp[d1][mid]<=tmp){
dp[d1][mid]=tmp;
dp2[d][mid]=i;
}
}
solve(d,l,mid,ol,dp2[d][mid]+1);
solve(d,mid+1,r,dp2[d][mid],orr);
}
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
ps[i+1]=ps[i]+a[i];
}
for(int i=1;i<=k;i++){
solve(i,0,n,0,n);
}
printf("%lld\n",dp[k%2][n-1]);
int x=n-1;
vector<int> ans;
for(int i=k;i>0;i--){
ans.push_back(dp2[i][x]+1);
x=dp2[i][x];
}
for(int i=k-1;i>=0;i--){
printf("%d ",ans[i]);
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:33:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
^
sequence.cpp:35:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[i]);
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
9 ms |
83272 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
9 ms |
83272 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
6 ms |
83272 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
6 ms |
83272 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
6 ms |
83272 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
3 ms |
83272 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
83272 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
83272 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
83 ms |
83272 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
0 ms |
83272 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
69 ms |
83272 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
63 ms |
83272 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
76 ms |
83272 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
59 ms |
83272 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
59 ms |
83272 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
76 ms |
83272 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
83272 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
36 ms |
83272 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
886 ms |
83272 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
19 ms |
83272 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1229 ms |
83272 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
766 ms |
83272 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
956 ms |
83272 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
699 ms |
83272 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
769 ms |
83272 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
939 ms |
83272 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |