#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 n = R;
vector<ll>p(n,0);
for(int i=0;i<n;i++){
p[i] = X[i];
if(i)p[i]+=p[i-1];
}
int ans = 0;
for(int i=0;i<n;i++){
int l = 1,r = min(i+1,n-i-1);
while(r>=l){
int mid = (l+r)/2;
ll a = p[i+mid] - p[i];
ll b = p[i] - (i-mid>=0?p[i-mid]:0);
if(a-b > B)r = mid-1;
else l = mid+1;
}
ans = max(ans,2*r);
l = 1,r = min(i+1,n-i);
while(r>=l){
int mid = (l+r)/2;
ll a = p[i+mid-1] - p[i];
ll b = p[i] - (i-mid>=0?p[i-mid]:0);
if(a-b+X[i] > B)r = mid-1;
else l = mid+1;
}
ans = max(ans,2*r-1);
}
return ans;
}
