#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<ll, ll>
#define p3i pair<pii, ll>
#define pll pair<ll, int>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define p_q priority_queue
#define MN 1000000009
int pre[100005][205], l2, n, k, a, p[205], lst;
ll ans=-1, t, psa[100005];
deque<pair<ll, int> > mon[205];
void out(int P, int K){
if (K!=0) out(pre[P][K], K-1);
printf("%i ", P);
}
ll cross(pll A, pll O, pll B){
return (A.x-O.x)*(-psa[B.y]+psa[O.y])-(B.x-O.x)*(-psa[A.y]+psa[O.y]);
}
void add(ll K, pair<ll, int> P){
while(mon[K].size()>p[K]+1 && cross(mon[K][mon[K].size()-2], mon[K].back(), P)<=0){
mon[K].pop_back();
}
mon[K].pb(P);
}
int main(){
mon[0].pb(mp(0, 0));
cin >> n >> k;
for (int l=1; l<=n; ++l){
cin >> a; psa[l]=a+psa[l-1];
}
for (int l=1; l<=n; ++l){
for (l2=k-1; l2>=0; --l2){
if (mon[l2].empty()) continue;
while(p[l2]+1<mon[l2].size() &&
(psa[n]-psa[l])*(psa[l]-psa[mon[l2][p[l2]].y])+mon[l2][p[l2]].x<=
(psa[n]-psa[l])*(psa[l]-psa[mon[l2][p[l2]+1].y])+mon[l2][p[l2]+1].x)
mon[l2].pop_front();//, cout << "*";
pre[l][l2]=mon[l2][p[l2]].y;
t=(psa[n]-psa[l])*(psa[l]-psa[mon[l2][p[l2]].y])+mon[l2][p[l2]].x;
//cout << t << ' ' ;
if (l2==k-1 && t>ans){
ans=t; lst=l;
}
add(l2+1, mp(t, l));
}
//cout << endl;
}
cout << ans << endl;
if (lst!=-1) out(lst, k-1);
return 0;
}
Compilation message
sequence.cpp: In function 'void add(long long int, std::pair<long long int, int>)':
sequence.cpp:30:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(mon[K].size()>p[K]+1 && cross(mon[K][mon[K].size()-2], mon[K].back(), P)<=0){
^
sequence.cpp: In function 'int main()':
sequence.cpp:44:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(p[l2]+1<mon[l2].size() &&
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
83092 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
83092 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
83092 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
83092 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
83092 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
83092 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
83356 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
83092 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
83092 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
83224 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
83352 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
109 ms |
84016 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
83356 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
66 ms |
83880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
76 ms |
83612 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
89 ms |
83884 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
66 ms |
84148 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
86 ms |
83884 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
123 ms |
83880 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
85484 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
36 ms |
85468 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1259 ms |
93000 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
49 ms |
86164 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1493 ms |
91780 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
943 ms |
88632 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1186 ms |
92060 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
923 ms |
91560 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
873 ms |
91384 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1186 ms |
91688 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
