#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[2][100001],sum[100001],ans;
int n,k,i,l,a[100001],dp2[201][100001],idx;
vector<int> v;
struct line{
ll k,d;
int idx;
};
ll val(line a,ll x){
return a.k*x+a.d;
}
double intt(line a,line b){
return double(b.d-a.d)/(a.k-b.k);
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> k;
for(i=1;i<=n;i++){
cin >> a[i];
sum[i]=sum[i-1]+a[i];
}
for(l=1;l<=k;l++){
deque<line> q;
q.push_back({sum[l-1],dp[0][l-1]-sum[n]*sum[l-1],l-1});
for(i=l;i<n;i++){
while(q.size()>=2 && val(q.back(),sum[i])<=val(q[q.size()-2],sum[i])) q.pop_back();
dp[1][i]=sum[n]*sum[i]-sum[i]*sum[i]+val(q.back(),sum[i]);
dp2[l][i]=q.back().idx;
line cur={sum[i],dp[0][i]-sum[n]*sum[i],i};
dp[0][i]=dp[1][i];
if(a[i]==0) continue;
while(q.size()>=2 && intt(cur,q[0])<=intt(q[0],q[1])) q.pop_front();
q.push_front(cur);
}
}
for(i=k;i<n;i++){
if(dp[1][i]>=ans){
ans=dp[1][i];
idx=i;
}
}
for(i=k;i>=1;i--){
v.push_back(idx);
idx=dp2[i][idx];
}
reverse(v.begin(),v.end());
cout << ans << "\n";
for(i=0;i<k;i++) cout << v[i] << " ";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 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 |
6492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4444 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 |
4444 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 |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
22876 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 |
6488 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
12636 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 |
6492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
29 ms |
80440 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
57692 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
74332 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
10 ms |
80476 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
20828 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
14684 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
24920 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4560 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
80476 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
80476 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
70252 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
80476 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
80472 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
18780 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
35164 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4696 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
4696 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
49 ms |
80660 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
4700 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
49688 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
39 ms |
57944 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
49 ms |
62036 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
36 ms |
51792 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
38 ms |
58028 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
50 ms |
74488 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
6748 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
13 ms |
6748 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
419 ms |
81956 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
6748 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
563 ms |
82064 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
345 ms |
59060 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
447 ms |
63508 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
321 ms |
53056 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
309 ms |
59208 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
416 ms |
75656 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
