#include "ricehub.h"
#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define sort_uniq(x) sort(all(x)), uniq(x);
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define V vector
#define V2dll V<V<ll>>
#define V2dint V<V<int>>
#define V2dchar V<V<char>>
#define V2dbool V<V<bool>>
#define V3dll V<V<V<ll>>>
#define V3dint V<V<V<int>>>
#define V3dchar V<V<V<char>>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define INF INT32_MAX
#define blt __builtin_popcount
#define clr(x) x.clear()
#define ff first
#define ss second
#define popf pop_front
#define popb pop_back
#define sz(x) int(x.size())
#define rep(a, b, c, d) for (int a = b; a <= c; a += d)
#define repl(a, b, c, d) for (int a = b; a >= c; a -= d)
mt19937_64 rng(chrono::steady_clock().now().time_since_epoch().count());
const int N = 1e5 + 5;
ll pref[N];
ll a[N];
int n;
int
ll sum(int l, int r)
{
int mid = l +r >> 1;
return (a[mid] * (mid - l + 1) - (pref[mid] - pref[l - 1]) +
(pref[r] - pref[mid]) - a[mid] * (r - mid));
}
int besthub(int R, int L, int X[], long long B)
{
n = R;
rep(i, 1, n, 1) {
a[i] = X[i - 1];
}
pref[0] = 0;
rep(i, 1, n, 1)
pref[i] = pref[i - 1] + a[i];
int r = 1, ans = 0;
rep(i, 1, n, 1) {
while (r < n && sum(i, r + 1) <= B)
++r;
ans = max(ans, r - i + 1);
}
return ans;
}
