#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;
const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;
const int N = 1e5 + 5;
int n;
int a[N];
ll m;
ll L[N];
int ptr, ans = 1;
ll getL(int i, int j) {
return (ll) (j - i + 1) * a[j] - (L[j] - L[i - 1]);
}
ll getR(int i, int j) {
return L[j] - L[i - 1] - (ll) (j - i + 1) * a[i];
}
bool check(int i, int j) {
ll need = getL(i, j);
if(need > m)
return 0;
ans = max(ans, j - i + 1);
ptr = max(ptr, j);
while(ptr + 1 <= n and a[ptr + 1] - a[j] <= a[j] - a[i]) {
ptr++;
if(getL(i, j) + getR(j, ptr) <= m)
ans = max(ans, ptr - i + 1);
else {
ptr--;
return 0;
}
}
return 1;
}
void solve() {
for(int i = 1; i <= n; i++)
L[i] = L[i - 1] + a[i];
:: ptr = 1;
int ptr = 1;
for(int i = 1; i <= n; i++) {
ptr = max(ptr, i);
while(ptr + 1 <= n and check(i, ptr + 1))
ptr++;
}
}
int besthub(int R, int L, int X[], long long B) {
n = R;
m = B;
for(int i = 0; i < n; i++) {
a[i + 1] = X[i];
}
for(int i = 1; i <= n; i++) {
a[i] = L - X[n - i] + 1;
}
solve();
return ans;
}
