#include "bits/stdc++.h"
#include "ricehub.h"
// #include "grader.cpp"
using namespace std;
int p[500005];
int besthub(int R, int L, int X[], long long B) {
int l = 1, r = R, ans = 0;
for(int i = 0; i < R; i++) {
p[i + 1] = p[i] + X[i];
}
while(l <= r) {
long long mid = (l + r) / 2, ok = 0;
for(int i = 0; i < R; i++) {
if(i + 1 >= mid) {
int sm = p[i + 1] - p[(i + 1) - mid];
int med = (i + (i - mid + 1)) / 2;
sm -= p[med + 1] * 2;
if(sm <= B) {
ok = 1;
break;
}
}
}
if(ok) {
l = mid + 1;
ans = mid;
}
else r = mid - 1;
}
return ans;
}
