#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B) {
long long pref[R];
for (int i = 0; i < R; i++)
pref[i] = (i ? pref[i - 1] : 0) + X[i];
int l = 0, ans = 0;
for (int r = 0; r < R; r++) {
int med = (r - l) / 2 + l;
long long cost = ((long long) X[med]) * (med - l + 1) - (pref[med] - pref[l] + X[l]);
cost += pref[r] - pref[med] - ((long long) X[med]) * (r - med);
if (cost > B) {
l++;
r--;
} else
ans = max(ans, r - l + 1);
}
return ans;
}
