#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int besthub(int R, int L, int X[], ll B){
queue<ll> l, r;
for (int i=0; i<R; i++) r.push(X[i]);
int bsf = 0, curl = 0, curr = 0, i = 0;
ll k = 0;
while (true){
while ((!r.empty() && ((k+(r.front()-(ll) X[i])) <= B)) || (!l.empty() && !r.empty() && curl && (r.front()-X[i]) < (X[i]-l.front()))){
while (!r.empty() && ((k+(r.front()-(ll) X[i])) <= B)){
k += r.front()- (ll) X[i];
l.push(r.front());
r.pop();
curr++;
}
if (!l.empty() && !r.empty() && curl && (r.front()-X[i]) < (X[i]-l.front())){
k += r.front()+l.front()-2ll* (ll) X[i];
l.pop();
l.push(r.front());
r.pop();
curl--;
curr++;
}
}
if (k <= B) bsf = max(bsf, curl+curr);
//cout << i << " " << curl << " " << curr << " " << k << " " << bsf << "\n";
i++;
if (i == R) break;
curl++; curr--;
k += (ll) (curl-curr) * (ll) (X[i]-X[i-1]);
}
return bsf;
}
