#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int besthub(int R, int L, int X[], ll B){
int cl = 0, cr = 0;
ll cur = 0;
for (int i=0; i<R; i++){
while (true){
if (cl == cr){
if (i-cl-1 >= 0 && cur + X[i] - X[i-cl-1] <= B){
cl++;
cur += X[i]-X[i-cl];
}
else break;
}
else {
if (i+cr+1 < R && cur + X[i+cr+1] - X[i] <= B){
cr++;
cur += X[i+cr]-X[i];
}
else break;
}
}
if (i+cr+1 >= R) break;
cur -= X[i]-X[i-cl];
cur += (cl-cr)*(X[i+1]-X[i]);
cur += X[i+cr+1]-X[i+1];
}
return cl+cr+1;
}
