#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 5;
ll dpl[maxn], dpr[maxn];
int l, res = -1;
int besthub(int n, int len, int x[], ll b){
for(int i=2;i<=n;++i){
dpl[i] = dpl[i-1] + 1LL*(i-1)*(x[i-1] - x[i-2]);
}
for(int i=n-1;i>=1;--i){
dpr[i] = dpr[i+1] + 1LL*(n-i)*(x[i] - x[i-1]);
}
l = 1;
for(int i=1;i<=n;++i){
int m = l + (i-l)/2;
ll cost = (dpl[m] - dpl[l] - 1LL*(l-1)*(x[m-1] - x[l-1])) + (dpr[m] - dpr[i] - (n-i)*(x[i-1] - x[m-1]));
while(l < i && cost > b){
++l;
m = l + (i-l)/2;
cost = (dpl[m] - dpl[l] - 1LL*(l-1)*(x[m-1] - x[l-1])) + (dpr[m] - dpr[i] - (n-i)*(x[i-1] - x[m-1]));
}
res = max(res, i - l + 1);
}
return res;
}
