#include "ricehub.h"
using namespace std;
#include<bits/stdc++.h>
int besthub(int R, int L, int X[], long long B)
{
int max_count = 0;
vector<long long> pref(R+1);
for(int i = 1; i <= R; i++){
pref[i] = pref[i-1] + X[i-1];
}
for(int l = 1; l <= R; l++){
for(int r = l; r <= R; r++){
int m = (l + r) / 2;
long long leftCost = X[m-1] * (m - l + 1) - (pref[m] - pref[l-1]);
long long rightCost =(pref[r] - pref[m]) - X[m-1] * (r - m);
long long cost = leftCost + rightCost;
if(cost <= B){
max_count = max(max_count, r - l + 1);
}
else{
break;
}
}
}
return max_count;
}
