#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B) {
int ret = 0, mm = 0;
long long b = 0;
int rr = 0;
for (int ll = 0; ll < R; ll++) {
while (rr < R) {
long long ob = b;
b += X[rr] - X[mm];
if (ll + (rr - ll) / 2 > mm) {
b -= (long long)(rr - mm) * (X[mm + 1] - X[mm]);
mm++;
b += (long long)(mm - ll) * (X[mm] - X[mm - 1]);
}
if (b > B) {
b = ob;
break;
}
rr++;
}
ret = max(ret, rr - ll);
b -= X[mm] - X[ll];
if (ll + (rr - ll) / 2 > mm) {
b -= (long long)(rr - mm) * (X[mm + 1] - X[mm]);
mm++;
b += (long long)(mm - ll - 1) * (X[mm] - X[mm - 1]);
}
}
return ret;
}
