#include <bits/stdc++.h>
#include "ricehub.h"
#define long long long
using namespace std;
const int N = 1e5+5;
long pref[N], A[N];
int besthub(int R, int L, int X[], long B) {
for(int i = 1; i <= R; ++i) pref[i] = pref[i-1] + X[i-1];
int l = 1, r = R;
auto calc = [&](int m, int l, int r) {
long lhs = ((m-l+1) * pref[m]) - (pref[m] - pref[l-1]);
long rhs = (pref[r] - pref[m-1]) - ((r-m+1) * pref[m]);
return lhs + rhs <= B;
};
while(l < r) {
int m = (l + r + 1) >> 1;
bool st = false;
for(int l = 1, r = m; r <= R; l++, r++) {
int z = (l + r) >> 1;
st |= calc(z, l, r);
}
if(st) l = m;
else r = m - 1;
}
return l;
}
