#pragma GCC optimize("Ofast")
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
int n = R;
vector<ll>x(n+1);
for(int i=1;i<=n;i++)x[i] = X[i-1];
vector<ll>pref(n+1);
for(int i=1;i<=n;i++)pref[i] = pref[i-1]+x[i];
//for(int i=0;i<=n;i++)cout<<pref[i]<<" ";
//cout<<'\n';
for(int l=1,r=1;r<=n;r++){
int mid = (l+r)/2;
ll lf = pref[mid]-pref[l-1];
ll rg = pref[r]-pref[mid];
ll cost = (mid-l+1)*x[mid] - lf + rg -(r-mid)*x[mid];
while(cost > B){
l++;
mid = (l+r)/2;
lf = pref[mid]-pref[l-1];
rg = pref[r]-pref[mid];
cost = (mid-l+1)*x[mid] - lf + rg -(r-mid)*x[mid];
}
//cout<<l<<" "<<r<<" "<<cost<<'\n';
ans = max(ans,r-l+1);
}
return ans;
}
