#include "ricehub.h"
#include <vector>
#include <algorithm>
#include <climits>
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
std :: vector<long long> pre(R + 1, 0);
for(int i = 1; i <= R; ++i) pre[i] = pre[i - 1] + X[i - 1];
for(int i = 0; i < R; ++i) {
int lo = 0;
for(int k = 31 - __builtin_clz(R); k >= 0; --k) {
int n = lo | (1 << k);
if(i - n + 1 < 0 || i + n > R) continue;
int mid = n / 2;
auto L = pre[i + 1] - pre[i - mid];
auto R = pre[i + mid + 1] - pre[i + 1];
if(n & 1) {
if(R - L <= B) lo = n;
} else {
if(i + mid + 1 < R && R + X[i + mid + 1] - L - X[i] <= B) lo = n;
if(i - mid - 1 >= 0 && R - L - X[i - mid - 1] + X[i] <= B) lo = n;
}
}
ans = std :: max(ans, lo);
}
return ans;
}
