#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005;
int pos[N];
ll sum[N];
int n;
long long money;
bool poss(int len)
{
ll cost = 0;
int a = 0;
int b = len - 1;
int mid = (a + b) / 2;
//cout << len << " " << cost << " " << money << endl;
while (b < n)
{
cost = 0;
if (a != mid) cost -= sum[mid - 1];
if (a != 0) cost += sum[a - 1];
cost += sum[b];
cost -= (ll) (b - mid) * pos[mid];
cost += (ll) (mid - a) * (pos[mid]);
cost -= sum[mid];
mid++;
a++;
b++;
if (cost <= money) return true;
}
return false;
}
int binarySearch()
{
int a = 1;
int b = n;
int res = -1;
while (a <= b)
{
int mid = (a + b) / 2;
if (poss(mid))
{
res = mid;
a = mid + 1;
} else
{
b = mid - 1;
}
}
return res;
}
int besthub(int n1, int l, int x[], long long money1)
{
money = money1;
n = n1;
for (int i = 0; i < n; i++)
{
pos[i] = x[i];
}
for (int i = 0; i < n; i++)
{
sum[i] += pos[i];
if (i != 0) sum[i] += sum[i - 1];
}
return binarySearch();
}
