#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define ar array
#define nl '\n'
// #include "grader.cpp"
int besthub(int n, int l, int x[], long long B) {
int ans = 0;
for(int i = n / 2; i < n; i++) {
int l = i - 1, r = i + 1, cost = 0, res = 1;
while(l >= 0 && r < n) {
int a = x[i] - x[l], b = x[r] - x[i];
if(a < b) {
if(cost + a > B) break;
cost += a;
l--;
} else {
if(cost + b > B) break;
cost += b;
r++;
}
res++;
}
while(l >= 0) {
int a = x[i] - x[l];
if(cost + a > B) break;
cost += a;
l--;
res++;
}
while(r < n) {
int a = x[r] - x[i];
if(cost + a > B) break;
cost += a;
r++;
res++;
}
ans = max(ans, res);
if(ans == n) return n;
}
for(int i = n / 2 - 1; i >= 0; i--) {
int l = i - 1, r = i + 1, cost = 0, res = 1;
while(l >= 0 && r < n) {
int a = x[i] - x[l], b = x[r] - x[i];
if(a < b) {
if(cost + a > B) break;
cost += a;
l--;
} else {
if(cost + b > B) break;
cost += b;
r++;
}
res++;
}
while(l >= 0) {
int a = x[i] - x[l];
if(cost + a > B) break;
cost += a;
l--;
res++;
}
while(r < n) {
int a = x[r] - x[i];
if(cost + a > B) break;
cost += a;
r++;
res++;
}
ans = max(ans, res);
if(ans == n) return n;
}
return ans;
}
