#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int N, int L, int x[], long long B)
{
//N^2
int res = 1;
for(int i = 0; i < N; ++i){
int l = i, r = i;
int t = B;
while(t > 0 && l > 0 && r < N-1){
if(l-1 >= 0 && r+1 < N){
if(x[i]-x[l-1] < x[r+1]-x[i] && x[i]-x[l-1] <= t){
t -= x[i]-x[--l];
}else if(x[r+1] - x[i] <= t){
t -= x[++r]-x[i];
}
}else if(l-1 >= 0 && x[i]-x[l-1] <= t){
t -= x[i]-x[--l];
}else if(r+1 < N && x[r+1]-x[i] <= t){
t -= x[++r]-x[i];
}else{
break;
}
}
res = max(res, r-l+1);
}
return res;
}
