#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e5+5;
const ll K=2e2+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll dp[2][N],n,k,u[N];
int from[K][N];
vector<ll> ans;
deque<pair<pll,ll> > dq;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k;
REP1(i,n)cin>>u[i],u[i]+=u[i-1];
REP1(i,n)dp[0][i]=-INF;
dp[0][0]=0;
REP1(T,k+1){
dq.clear();
dq.pb(mp(mp(0,dp[(T-1)&1][0]),0));
REP1(i,n){
while(SZ(dq)>1&&dq[0].X.X*u[i]+dq[0].X.Y<=dq[1].X.X*u[i]+dq[1].X.Y)dq.pop_front();
dp[T&1][i]=dq[0].X.X*u[i]+dq[0].X.Y;
from[T][i]=dq[0].Y;
ll a=u[i],b=dp[(T-1)&1][i]-u[i]*u[i];
while(SZ(dq)>1){
ll m=SZ(dq)-1;
if((b-dq[m].X.Y)*(dq[m-1].X.X-dq[m].X.X)<=(dq[m].X.Y-dq[m-1].X.Y)*(dq[m].X.X-a))dq.pop_back();
else break;
}
dq.pb(mp(mp(a,b),i));
}
}
cout<<dp[(k+1)&1][n]<<"\n";
for(int T=k+1,i=n;T>=1&&from[T][i];T--){
ans.pb(i=from[T][i]);
}
reverse(ans.begin(),ans.end());
REP(i,k)cout<<ans[i]<<(i==k-1?"\n":" ");
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1516 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1516 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
748 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2156 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
2156 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1900 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2156 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2172 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1132 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
876 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
1004 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
77 ms |
9604 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
1004 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
62 ms |
6124 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
66 ms |
7020 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
67 ms |
7404 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
52 ms |
6252 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
7020 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
77 ms |
8812 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
5204 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
6220 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
764 ms |
83832 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
6640 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
998 ms |
83564 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
688 ms |
60076 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
683 ms |
64240 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
555 ms |
53236 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
590 ms |
60388 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
753 ms |
75932 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
