#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a) for (int i=0;i<(a);++i)
#define FORR(i,a) for (int i=(a)-1;i>=0;i--)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORTR(i,a,b) for (int i=(b);i>=(a);--i)
#define trav(i,v) for (auto i : v)
#define fr first
#define sc second
#define x real
#define y imag
typedef long long ll;
typedef long double ld;
typedef complex<ll> point;
const int N = 2e5+6;
const int K = 406;
class conv_hull{
public:
vector<point> lines;
vector<int> ind;
int pos=0;
ll f(point a, ll x) {
return a.x()*x+a.y();
}
ld inter(point a,point b){
ll k=a.x()-b.x();
ll c=b.y()-a.y();
//cout<<k<<endl;
//cout<<c/k<<endl;
return (ld)c/k;
}
void add_line(point nw,int index){
if (!lines.empty() && nw.x()==lines.back().x()){
return;
}
while (lines.size()>1){
//cout<<1<<endl;
point a=lines.back();
point b=lines[lines.size()-2];
//cout<<1<<endl;
if (inter(nw,b)<=inter(b,a)){
lines.pop_back();
ind.pop_back();
}
else break;
}
lines.push_back(nw);
ind.push_back(index);
}
pair<ll,int> get(ll x){
//cout<<pos<<" "<<lines.size()<<endl;
while(pos<lines.size()-1 && inter(lines[pos],lines[pos+1])<=(ld)x){
pos++;
}
//cout<<lines[pos]<<endl;
return {f(lines[pos],x),ind[pos]};
}
void del(){
lines.clear();
ind.clear();
pos=0;
}
};
ll a[N],dp[N],pref[N];
int nax[K][N];
int main(){
ios_base::sync_with_stdio(false);
//cout<<"hi"<<endl;
int n,k;
cin>>n>>k;k++;
FORT (i,1,n){
cin>>a[i];
pref[i]=pref[i-1]+a[i];
}
FORT(i,1,n){
dp[i]=pref[i]*pref[i];
}
conv_hull t;
FORT(i,2,k){
t.add_line({-2ll*pref[i-1],dp[i-1]+pref[i-1]*pref[i-1]},i-1);
//cout<<-pref[i-1]<<" "<<dp[i-1][i-1]+pref[i-1]*pref[i-1]<<endl;
FORT(j,i,n){
ll z=dp[j];
pair<ll,int> tv=t.get(pref[j]);
dp[j]=tv.fr+pref[j]*pref[j];
nax[i][j]=tv.sc;
t.add_line({-2ll*pref[j],z+pref[j]*pref[j]},j);
//cout<<-2ll*pref[j]<<" "<<dp[i-1][j]+pref[j]*pref[j]<<endl;
}
t.del();
//cout<<endl;
}
cout<<(pref[n]*pref[n]-dp[n])/2ll<<endl;
int tv=nax[k][n];
vector<int> v;
FORTR(i,1,k-1){
v.push_back(tv);
tv=nax[i][tv];
}
reverse(v.begin(),v.end());
trav(ans,v)cout<<ans<<" ";
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In member function 'std::pair<long long int, int> conv_hull::get(ll)':
sequence.cpp:58:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(pos<lines.size()-1 && inter(lines[pos],lines[pos+1])<=(ld)x){
~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
404 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
292 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
500 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
296 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
368 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
308 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1528 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1528 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1912 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2340 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
2192 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
64 ms |
9784 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1080 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
56 ms |
6136 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
40 ms |
7032 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
50 ms |
7588 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
34 ms |
6328 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
38 ms |
7204 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
48 ms |
8888 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
6056 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
5928 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
429 ms |
84904 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
6952 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
617 ms |
84240 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
392 ms |
60464 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
498 ms |
65028 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
341 ms |
53912 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
329 ms |
60876 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
436 ms |
76584 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
