#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxn=1e5+5,mxk=205;
int n,k,aa[mxn];
int par[mxn][mxk];
ll dp[mxn][2],pre[mxn],ans;
deque<int>cht;
bool comp(int x,int y,ll w,bool z){
ll xx=(-pre[x])*w+dp[x][z],yy=(-pre[y])*w+dp[y][z];
return xx>yy;
}
bool cmp(int x,int y,int w,bool z){
return (dp[w][z]-dp[y][z])*(pre[y]-pre[x])<(dp[y][z]-dp[x][z])*(pre[w]-pre[y]);
}
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>aa[i];
pre[i]=pre[i-1]+aa[i];
}
for(int i=1;i<=n;i++){
dp[i][1]=pre[i]*(pre[n]-pre[i]);
}
for(int j=2;j<=k;j++){
bool y=j&1;
cht.push_back(j-1);
for(int i=j;i<n;i++){
//ax+b
ll x=pre[n]-pre[i];
while(cht.size()>1 && !comp(cht[0],cht[1],x,y^1))cht.pop_front();
ll a=-pre[cht[0]],b=dp[cht[0]][y^1];
dp[i][y]=a*x+b+pre[i]*x;
par[i][j]=cht[0];
while(cht.size()>1 && !cmp(cht[cht.size()-2],cht.back(),i,y^1))cht.pop_back();
cht.push_back(i);
}//cout<<'\n';
cht.clear();
}
for(int i=1;i<n;i++){
int y=k&1;
if(dp[i][y]>=dp[ans][y])ans=i;
}
cout<<dp[ans][k&1]<<'\n';
vector<int>v;
while(ans!=0){
v.push_back(ans);
ans=par[ans][k];
k--;
}
reverse(v.begin(),v.end());
for(auto i:v){
cout<<i<<" ";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4548 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
4644 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
4444 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
4440 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
4444 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
4568 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
4444 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
4568 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
4444 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
10584 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
10840 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
39 ms |
10588 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
10844 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
32 ms |
10844 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
34 ms |
10584 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
39 ms |
10844 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
27 ms |
10840 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
33 ms |
10584 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
40 ms |
10844 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
83540 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
83548 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
393 ms |
83608 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
31 ms |
83500 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
548 ms |
83548 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
416 ms |
83356 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
398 ms |
83604 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
291 ms |
83600 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
318 ms |
83580 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
417 ms |
83544 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
