#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[100010], S[100010];
ll dp[100010];
int prv[205][100010];
struct Line{
ll a,b,idx;
};
Line dq[100010];
Line line[2][100010];
int l, r;
inline ll f(Line a, ll x){
return a.a * x + a.b;
}
int main(){
scanf("%d%d",&N,&K);
repp(i,N) scanf("%lld",&a[i]);
repp(i,N) S[i] = S[i-1] + a[i];
for(int k=0;k<=K;k++){
l = r = 0;
for(int i=k+1;i<=N;i++){
if( k == 0 ) dp[i] = 0;
else{
// insert at back
dq[r++] = line[k&1][i-1];
while( r-l >= 3 ){
int i1 = r-1, i2 = r-2, i3 = r-3;
if( (dq[i3].b-dq[i1].b)*(dq[i2].a-dq[i3].a) <= (dq[i3].b-dq[i2].b)*(dq[i1].a-dq[i3].a) ){
r--;
dq[r-1] = dq[r];
}
else break;
}
// proceed at front
while( r-l >= 2 ){
if( f(dq[l],S[i]) <= f(dq[l+1],S[i]) ) l++;
else break;
}
dp[i] = f(dq[l], S[i]);
prv[k][i] = dq[l].idx;
}
Line nl = {S[i], dp[i]-S[i]*S[i], i};
line[!(k&1)][i] = nl;
}
//for(int i=k+1;i<=N;i++) line[i] = nline[i];
}
printf("%lld\n",dp[N]);
vector<int> ansv;
int idx = N;
for(int k=K;k>=1;k--){
ansv.push_back(prv[k][idx]);
idx = prv[k][idx];
if( !( 1 <= idx && idx <= N-1 ) ) break;
}
sort(all(ansv));
for(auto e : ansv) printf("%d ",e); printf("\n");
//tt();
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:131:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(auto e : ansv) printf("%d ",e); printf("\n");
^~~
sequence.cpp:131: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:87: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:88: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]);
~~~~~^~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 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 |
376 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 |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
2 ms |
376 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 |
376 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 |
2 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 |
376 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 |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
376 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 |
376 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 |
504 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 |
1404 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 |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
2 ms |
636 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 |
760 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 |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
6 ms |
1912 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
7 ms |
2168 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
6 ms |
2168 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
760 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 |
4 ms |
1400 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
38 ms |
9944 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
35 ms |
6392 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
39 ms |
7320 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
41 ms |
7800 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
28 ms |
6648 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
33 ms |
7416 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
41 ms |
9112 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
25 ms |
10360 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
28 ms |
10488 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
381 ms |
87952 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
25 ms |
11128 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
563 ms |
87792 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
360 ms |
64376 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
398 ms |
68728 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
274 ms |
57720 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
307 ms |
64468 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
385 ms |
80200 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |