#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct line {
ll a, b; int ind;
ll get(ll x) { return a*x+b; }
line() {}
line(ll a, ll b, ll i) : a(a), b(b), ind(i) {}
};
struct cht {
vector<line> l;
int t;
cht() : t(0) {}
void upd(line v) {
while (t+1<l.size() && (l.back().b<=v.b || (l[l.size()-2].b-v.b)*(l.back().a-l[l.size()-2].a)<=(l[l.size()-2].b-l.back().b)*(v.a-l[l.size()-2].a))) l.pop_back();
l.emplace_back(v);
}
pair<ll, ll> get(ll x) {
while (t+1<l.size() && l[t].get(x)<l[t+1].get(x)) t++;
return {l[t].get(x), l[t].ind};
}
};
vector<int> rt, ans;
pair<ll, ll> sol(vector<ll> &a, ll s, bool q=false) {
int n=a.size();
vector<ll> d(n), l(n), c(n), ss;
for (int i=0; i<n; i++) ss.emplace_back((ss.size()?ss.back():0)+a[i]);
cht st;
st.upd(line(2*ss.back(), 0, -1));
for (int i=0; i<n; i++) {
auto [v, j]=st.get(ss[i]);
d[i]=v-2*ss[i]*ss[i]+s;
l[i]=j;
c[i]=(j<0?0:c[j])+1;
st.upd(line(2*(ss[i]+ss[n-1]), d[i]-2*ss[i]*ss[n-1], i));
}
if (q) {
rt.clear();
for (int i=n-1; i!=-1; i=l[i]) rt.emplace_back(i);
reverse(rt.begin(), rt.end());
}
return {d[n-1], c[n-1]};
}
void track(vector<ll> &a, ll s, int p) {
sol(a, -(2*s+1), true);
auto l=rt;
sol(a, -(2*s-1), true);
auto r=rt;
if (l.size()==p) { ans=l; return ; }
if (r.size()==p) { ans=r; return ; }
for (int i=0, j=0; i+1<r.size(); i++) {
while (l[j]<=r[i]) j++;
if (r[i+1]<=l[j]&&i+1+l.size()-j==p) {
for (int k=0; k<=i; k++) ans.emplace_back(r[k]);
for (int k=j; k<l.size(); k++) ans.emplace_back(l[k]);
return ;
}
}
puts("fuck");
assert(0);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin>>n>>k;
k++;
vector<ll> a(n);
for (auto &i:a) cin>>i;
ll s=0, e=1e18;
while (s<e) {
ll m=(s+e)/2;
auto c=sol(a, -(2*m+1)).second;
if (c>k) s=m+1;
else e=m;
}
cout<<(sol(a, -2*s+1).first-(-2*s+1)*k)/2<<'\n';
track(a, s, k);
for (int i=0; i<k-1; i++) cout<<ans[i]+1<<' ';
return 0;
}
Compilation message
sequence.cpp: In member function 'void cht::upd(line)':
sequence.cpp:18:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
18 | while (t+1<l.size() && (l.back().b<=v.b || (l[l.size()-2].b-v.b)*(l.back().a-l[l.size()-2].a)<=(l[l.size()-2].b-l.back().b)*(v.a-l[l.size()-2].a))) l.pop_back();
| ~~~^~~~~~~~~
sequence.cpp: In member function 'std::pair<long long int, long long int> cht::get(ll)':
sequence.cpp:22:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | while (t+1<l.size() && l[t].get(x)<l[t+1].get(x)) t++;
| ~~~^~~~~~~~~
sequence.cpp: In function 'void track(std::vector<long long int>&, ll, int)':
sequence.cpp:57:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
57 | if (l.size()==p) { ans=l; return ; }
| ~~~~~~~~^~~
sequence.cpp:58:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
58 | if (r.size()==p) { ans=r; return ; }
| ~~~~~~~~^~~
sequence.cpp:59:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for (int i=0, j=0; i+1<r.size(); i++) {
| ~~~^~~~~~~~~
sequence.cpp:61:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
61 | if (r[i+1]<=l[j]&&i+1+l.size()-j==p) {
| ~~~~~~~~~~~~~~^~~
sequence.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | for (int k=j; k<l.size(); k++) ans.emplace_back(l[k]);
| ~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Incorrect |
0 ms |
204 KB |
declared answer doesn't correspond to the split scheme: declared = 1542526, real = 1542524 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
204 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Incorrect |
1 ms |
332 KB |
declared answer doesn't correspond to the split scheme: declared = 1019625824, real = 1019625819 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
3 ms |
332 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
19 ms |
1124 KB |
declared answer doesn't correspond to the split scheme: declared = 1818678305, real = 1818678304 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
317 ms |
9532 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
326 ms |
9552 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Incorrect |
369 ms |
9992 KB |
declared answer doesn't correspond to the split scheme: declared = 497443232642597614, real = 496781753454350046 |
| 4 |
Halted |
0 ms |
0 KB |
- |
