#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,k,K,B,dp[100009],dp2[100009],f[100009],jm[100009],X;
deque <pair <pair <long long, long long>, long long> > de;
int DP[100003][203];
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>a>>k;k++;
for(i=1; i<=a; i++){
cin>>f[i];jm[i]=jm[i-1]+f[i];
}
for(j=2; j<=k; j++){
while(de.size()) de.pop_back();
for(i=j; i<=a; i++){
K=jm[i-1];B=dp[i-1]-jm[i-1]*jm[i-1];
while(de.size()){
if(de[de.size()-1].first.second<=B){
de.pop_back();
}else{
break;
}
}
while(de.size()>1){
zx=(B-de[de.size()-2].first.second)*(de[de.size()-2].first.first-de[de.size()-1].first.first);
xc=(de[de.size()-1].first.second-de[de.size()-2].first.second)*(de[de.size()-2].first.first-K);
if(zx>xc){
break;
}
de.pop_back();
}
de.push_back({{K,B},i-1});
X=jm[i];
while(de.size()>1){
zx=de[0].first.first*X+de[0].first.second;
xc=de[1].first.first*X+de[1].first.second;
if(zx<=xc){
de.pop_front();
}else{
break;
}
}
dp2[i]=de[0].first.first*X+de[0].first.second;
DP[i][j]=de[0].second;
}
for(i=1; i<=a; i++){
dp[i]=dp2[i];dp2[i]=0;
}
}
cout<<dp[a]<<"\n";
i=a;j=k;
while(j>1){
i=DP[i][j];j--;
cout<<i<<" ";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
324 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
320 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
328 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
324 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
316 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
320 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
448 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
452 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
452 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
448 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
456 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
456 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1080 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1096 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1096 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1196 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1092 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1100 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
8596 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
8780 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
8764 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8780 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
56 ms |
8724 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
59 ms |
8652 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
70 ms |
8756 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
49 ms |
8652 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
63 ms |
8736 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
76 ms |
8704 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
59 ms |
84048 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
51 ms |
84164 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
763 ms |
84548 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
51 ms |
84488 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
967 ms |
84288 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
660 ms |
84044 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
697 ms |
84492 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
563 ms |
84448 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
645 ms |
84244 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
781 ms |
84296 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
