#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
int ans = 1;
long long sumL[R+2]={}, sumR[R+2]={};
for( int i = 1; i <= R; i ++ ){
sumL[i] = sumL[i-1] + X[i-1];
}
for( int i = R; i >= 1; i -- ){
sumR[i] = sumR[i+1] + X[i-1];
}
for( int i = 1; i <= R; i ++ ){
int l = i, r = R+1;
while(r-l>1){
int m = (l+r)>>1;
long long mid = (sumL[m]-sumL[i-1])/(m-l+1);
int ll = i, rr = m+1;
while( rr-ll>1 ){
int mm=(ll+rr)>>1;
if(X[mm-1]>mid)
rr = mm;
else
ll = mm;
}
bool t = false;
if( mid*1ll*(ll-i+1)-(sumL[ll]-sumL[i-1])+
(sumR[ll]-sumR[m+1])-mid*1ll*(m-ll+1) <= B )
t = true;
if( mid < X[r-1] && (mid+1)*1ll*(ll-i+1)-(sumL[ll]-sumL[i-1])+
(sumR[ll+1]-sumR[m+1])-(mid+1)*1ll*(m-ll) <= B )
t = true;
if( t ){
ans = max(ans, m-i+1);
l = m;
}
else r = m;
}
}
return ans;
}
