//#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
int ans = 1;
vector<int64_t>pref(R + 1,0),dpref(R + 1,0);
for (int i = 0 ;i<R - 1;++i){
pref[i + 1] = pref[i] + (X[i + 1] - X[i]);
dpref[i + 2] = pref[i + 1] + dpref[i + 1];
}
auto dist = [&](int l,int r){
return pref[r] * (r - l) - dpref[r] + dpref[l];
};
auto distt = [&](int l,int r){
int mid = (l + r)>>1;
return min(dist(l,mid) + dist(mid,r),dist(l,mid + 1) + dist(mid + 1,r));
};
for (int i = 0;i<R;++i){
int j = i + 1;
while(j<R){
if (distt(i,j)<=B){
ans = max(ans,j - i + 1);
++j;
}
else{
break;
}
}
}
return ans;
}
