#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int n,k;
int bef[205][100005];
ll a[100005],pre[100005],dp[2][100005],q[100005],l=1,r=1;
bool case1(int x, int y, int i) {
return (dp[0][y] - dp[0][x] >= (pre[y] - pre[x]) * (pre[n] - pre[i]));
}
bool case2(int x, int y, int i) {
return ((dp[0][y] - dp[0][x]) * (pre[i] - pre[y]) <=
(dp[0][i] - dp[0][y]) * (pre[y] - pre[x]));
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>k;
pre[0]=0;
for(ll i=1;i<=n;i++){
cin>>a[i];
pre[i]=pre[i-1]+a[i];
}
fill(dp[0],dp[0]+n+5,0);
for(ll j=1;j<=k;j++){
q[r]=0;
r++;
for(ll i=1;i<=n;i++){
while(r-l>1&&case1(q[l],q[l+1],i)){
l++;
}
ll x=q[l];
dp[1][i]=dp[0][x]+(pre[i]-pre[x])*(pre[n]-pre[i]);
bef[j][i]=x;
while(r-l>1&&case2(q[r-2],q[r-1],i)){
r--;
}
q[r++]=i;
}
l=1;
r=1;
for(ll i=1;i<=n;i++){
dp[0][i]=dp[1][i];
}
}
ll mx=-1,ind=-1;
for(ll i=1;i<=n;i++){
if(dp[0][i]>mx){
mx=dp[0][i];
ind=i;
}
}
cout<<mx<<"\n";
for(ll i=0;i<k;i++){
cout<<ind<<' ';
ind=bef[k-i][ind];
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
6488 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
6492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
24920 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
14684 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
10588 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
29 ms |
82448 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
6496 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
59744 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
76240 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
9 ms |
82524 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
22876 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
6 ms |
16736 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
9 ms |
26972 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
23 ms |
82524 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
82524 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
72276 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
82524 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
82432 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
20828 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
37396 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
6616 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
24 ms |
82524 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
27 ms |
51804 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
23 ms |
59864 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
27 ms |
64092 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
18 ms |
53848 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
21 ms |
59996 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
26 ms |
76376 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6748 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
8 ms |
6748 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
158 ms |
83792 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
8 ms |
7000 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
304 ms |
83024 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
180 ms |
60124 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
209 ms |
64440 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
137 ms |
54284 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
141 ms |
60240 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
180 ms |
76772 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
