#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+10;
ll qs[N], a[N];
int besthub(int N, int L, int x[], long long B)
{
for(int i = 0; i < N; ++i) a[i+1] = x[i], qs[i+1] = qs[i]+x[i];
int ans = 0;
for(int i = 1; i <= N; ++i){
int l = i, r = N;
while(l < r){
int mid = (l+r+1)>>1;
int med = (mid+i)/2;
ll L = (med-i+1)*a[med] - (qs[med] - qs[i-1]);
ll R = (qs[mid]-qs[med]) - (mid-med)*a[med];
if(L+R <= B) l = mid;
else r = mid-1;
}
ans = max(ans, l-i+1);
}
return ans;
}
