#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll cum[100005],tab[100005];
ll sum(int a,int b){
if(a>b)return 0;
return cum[b]-(a?cum[a-1]:0);
}
int besthub(int R, int L, int X[], long long B)
{
for (int i = 0; i < R; ++i)
{
tab[i]=X[i];
cum[i]=X[i];
if(i)cum[i]+=cum[i-1];
}
int ans=1;
for (int i = 0; i < R; ++i)
for (int j = i+ans; j < R; ++j)
{
int idx=i+(j-i)/2;
int nb_a=idx-i,nb_b=j-idx;
ll cost=nb_a*X[idx]-sum(i,idx-1)+sum(idx+1,j)-nb_b*X[idx];
if(cost<=B)ans=max(ans,j-i+1);
else break;
}
return ans;
}
