#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int besthub(int R, int L, int X[], long long B)
{
vector<ll> psum(R);
psum[0] = X[0];
for (int i = 1; i < R; i++){
psum[i] = psum[i - 1] + X[i];
}
int ans = 0;
for (int i = 0, j = 0; j < R; j++){
int mid = (i + j) / 2;
ll sum_left = psum[mid] - (i - 1 >= 0? psum[i - 1]: 0);
ll sum_right = psum[j] - psum[mid];
ll sum = sum_right - (1LL * X[mid] * (j - mid)) + (1LL * X[mid] * (mid - i + 1)) - sum_left;
while (sum > B && i < j){
i++;
int mid = (i + j) / 2;
ll sum_left = psum[mid] - (i - 1 >= 0? psum[i - 1]: 0);
ll sum_right = psum[j] - psum[mid];
sum = sum_right - (1LL * X[mid] * (j - mid)) + (1LL * X[mid] * (mid - i + 1)) - sum_left;
}
if (sum <= B)
ans = max(ans, j - i + 1);
}
return ans;
}
