#include "ricehub.h"
#include <bits/stdc++.h>
#define N 100005
using namespace std;
int n,ar[N],ans;
long long b,pre[N];
bool check(int l,int r) {
long long sum = 0;
int mid = (l + r) / 2;
sum = 1ll * ar[mid] * (mid - l + 1) - (pre[mid] - pre[l - 1]);
sum += (pre[r] - pre[mid - 1]) - (1ll * ar[mid] * (r - mid + 1));
return sum <= b;
}
int besthub(int R, int L, int X[], long long B) {
n = R;
b = B;
for (int i = 1 ; i <= n ; i++)
ar[i] = X[i - 1];
for (int i = 1 ; i <= n ; i++)
pre[i] = pre[i - 1] + ar[i];
for (int i = 1 ; i <= n ; i++) {
int l = i, r = n;
while (l <= r) {
int mid = (l + r) / 2;
if (check(i,mid)) l = mid + 1;
else r = mid - 1;
}
ans = max(ans,l - i);
}
return ans;
}
