#include <bits/stdc++.h>
// #include "ricehub.h"
using namespace std;
#define endl "\n"
#define pb push_back
#define ll long long
#define fi first
#define se second
const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;
int R , A[N] , L , B , pr[N];
int besthub(int n, int sz, int X[], long long b){
for (int i=1 ; i<=n ; i++){
pr[i] = pr[i-1] + X[i-1];
}
int l=0 , r=n+1;
while(l+1 < r){
ll mid = (l+r)>>1 , cr = 1e18;
for (int i=0 ; i<n-mid+1 ; i++){
ll su = (pr[i+mid] - pr[i+(mid/2)]) - (pr[i+(mid/2)] - pr[i]);
if (mid&1){
su -= X[i+(mid/2)];
}
cr = min(cr , su);
}
// cout << mid << ' ' << cr << endl;
if (cr <= b){
l = mid;
}else{
r = mid;
}
}
return l;
}
// signed main(){
// cin >> R >> L >> B;
// for (int i=0 ; i<R ; i++){
// cin >> A[i];
// }
// cout << besthub(R , L , A , B);
// }
