#include <bits/stdc++.h>
using namespace std;
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a) cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }
void cio(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(15);
}
#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define endl '\n'
typedef tuple<ll,ll,ll> t3;
typedef tuple<ll,ll,ll,ll> t4;
void die(){printf("-1\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+9;
int N,K;
ll a[100200], S[100200];
ll dp[100200];
int prv[100200][205];
inline ll f(pair<pll,int> a, ll x){
return a.Fi.Fi * x + a.Fi.Se;
}
int main(){
scanf("%d%d",&N,&K);
repp(i,N) scanf("%lld",&a[i]);
repp(i,N) S[i] = S[i-1] + a[i];
//auto f = [](pair<pll,int> a, ll x)->ll{ return a.Fi.Fi * x + a.Fi.Se; };
deque<pair<pll, int>> dq, ndq;
for(int k=0;k<=K;k++){
for(int i=k+1;i<=N;i++){
if( k == 0 ) dp[i] = 0;
else{
while( sz(dq) >= 2 ){
pair<pll,int> l1 = dq.front(); dq.pop_front();
pair<pll,int> l2 = dq.front(); dq.pop_front();
dq.push_front(l2);
if( l2.Se > i-1 || f(l1, S[i]) > f(l2, S[i]) ){
dq.push_front(l1);
break;
}
}
dp[i] = f(dq.front(), S[i]);
prv[i][k] = dq.front().Se;
}
ndq.push_back({{S[i], dp[i]-S[i]*S[i]}, i});
while( sz(ndq) >= 3 ){
pair<pll,int> ll1 = ndq.back(); ndq.pop_back();
pair<pll,int> ll2 = ndq.back(); ndq.pop_back();
pair<pll,int> ll3 = ndq.back(); ndq.pop_back();
pll l1 = ll1.Fi, l2 = ll2.Fi, l3 = ll3.Fi;
if( (l3.Se-l1.Se)*(l2.Fi-l3.Fi) <= (l3.Se-l2.Se)*(l1.Fi-l3.Fi) ){
ndq.push_back(ll3); ndq.push_back(ll1);
}
else{
ndq.push_back(ll3); ndq.push_back(ll2); ndq.push_back(ll1);
break;
}
}
s
}
dq.clear();
while( sz(ndq) ){
dq.push_back(ndq.front());
ndq.pop_front();
}
}
printf("%lld\n",dp[N]);
vector<int> ansv;
int idx = N;
for(int k=K;k>=1;k--){
ansv.push_back(prv[idx][k]);
idx = prv[idx][k];
if( !( 1 <= idx && idx <= N-1 ) ) break;
}
sort(all(ansv));
for(auto e : ansv) printf("%d ",e); printf("\n");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:118:1: error: 's' was not declared in this scope
s
^
sequence.cpp:136:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(auto e : ansv) printf("%d ",e); printf("\n");
^~~
sequence.cpp:136:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
for(auto e : ansv) printf("%d ",e); printf("\n");
^~~~~~
sequence.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&K);
~~~~~^~~~~~~~~~~~~~
sequence.cpp:81:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
repp(i,N) scanf("%lld",&a[i]);
~~~~~^~~~~~~~~~~~~~
