#include "ricehub.h"
#include <iostream>
#include <cmath>
typedef long long ll;
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
for(ll i = R;i>=1;i--){
ll cost = 0;
ll med = ((i)/2);
//cout<<i<<"----\n";
for(ll j = 0;j<i;j++){
cost += abs(X[med]-X[j]);
}
if(cost<=B){ return i;}
for(ll j = 1;j<=R-i;j++){
//cout<<cost<<endl;
med++;
cost += abs(i/2)*(X[med]-X[med-1]);
//cout<<cost<<endl;
cost -= abs((i-1)/2)*(X[med]-X[med-1]);
//cout<<cost<<endl;
cost += abs(X[med]-X[j+i-1]);
//cout<<cost<<endl;
cost -= abs(X[med-1]-X[j-1]);
//cout<<cost<<"\n\n\n";
//med+=2;
if(cost<=B){return i;}
}
}
return 1;
}
