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