#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
deque<pair<pair<ll,ll>,ll>> dq;
//{m,c}
ll f(pair<ll,ll> l, ll x){
return l.first*x+l.second;
}
pair<ll,ll> query(ll x){
while (dq.size()>1){
if (f(dq[0].first,x)<f(dq[1].first,x)){
dq.pop_front();
} else {
break;
}
}
return {f(dq[0].first,x),dq[0].second};
}
long double intersect(ll m1, ll c1, ll m2, ll c2){
return (long double)(c2-c1)/(m1-m2);
}
long double intersect(pair<ll,ll> p1, pair<ll,ll> p2){
return intersect(p1.first,p1.second,p2.first,p2.second);
}
void addLine(pair<ll,ll> l, ll x){
ll s = dq.size();
if (dq[s-1].first.first==l.first){
if (dq[s-1].first.second<l.second){
dq.pop_back();
dq.push_back({l,x});
}
return;
}
while (dq.size()>1){
if (intersect(dq[s-1].first,l)<=intersect(dq[s-2].first,l)){
dq.pop_back();
s--;
} else {
break;
}
}
dq.push_back({l,x});
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
ll n,kv;
cin>>n>>kv;
vector<ll> p(n+1,0);
for (ll i = 1; i<=n; i++){
cin>>p[i];
p[i]+=p[i-1];
}
vector<vector<ll>> dp(n,vector<ll>(2,0));
vector<vector<int>> prev(n,vector<int>(kv+1,-1));
ll maxval = 0;
ll maxind = -1;
for (ll k = 1; k<=kv; k++){
dq.clear();
dq.push_back({{0,0},k-1});
for (ll x = k-1; x<n; x++){
/*for (auto i : dq){
cout<<i.first.first<<" "<<i.first.second<<", ";
}cout<<endl;*/
auto q = query(p[x]);
prev[x][k]=q.second;
dp[x][k%2] = q.first+p[x]*p[n]-p[x]*p[x];
//cout<<x<<" "<<k<<" "<<dp[x][k]<<endl;
addLine({p[x],dp[x][(k+1)%2]-p[n]*p[x]},x);
if (dp[x][k%2]>=maxval){
maxval=dp[x][k%2];
maxind=x;
}
}
}
vector<ll> ans;
for (ll k = kv; k>=1; k--){
ans.push_back(maxind);
//cout<<maxind<<endl;
maxind=prev[maxind][k];
}
cout<<maxval<<'\n';
for (ll i = ans.size()-1; i>=0; i--){
cout<<ans[i]<<' ';
}cout<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
544 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
1280 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
1280 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
1280 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
18 ms |
1408 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
640 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
768 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
1664 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
1664 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
118 ms |
9344 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
1664 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
78 ms |
6272 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
84 ms |
6912 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
103 ms |
7424 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
78 ms |
6400 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
88 ms |
7040 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
110 ms |
8576 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
13048 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
41 ms |
13324 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1164 ms |
90104 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
43 ms |
13432 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1237 ms |
90104 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
857 ms |
66456 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
947 ms |
71416 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
792 ms |
60408 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
844 ms |
66552 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1094 ms |
82168 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
