#include "ricehub.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n, m;
ll b;
int niz[maxn];
ll pref[maxn];
bool check(int x) {
{
int id = (1 + x) / 2;
ll zbirL = niz[id] * (id - 1) - pref[id - 1];
ll zbirR = pref[x] - pref[id] - niz[id] * (x - id);
if(zbirL + zbirR <= b)return 1;
}
ff(i,x + 1, n) {
int id = (i + i - x + 1) / 2;
ll zbirL = niz[id] * (id - (i - x + 1)) - (pref[id - 1] - pref[i - x]);
ll zbirR = pref[i] - pref[id] - niz[id] * (i - id);
if(zbirL + zbirR <= b)return 1;
}
return 0;
}
int besthub(int R, int L, int X[], ll B) {
n = R, m = L, b = B;
ff(i,1,n)niz[i] = X[i - 1];
ff(i,1,n)pref[i] = pref[i - 1] + niz[i];
int l = 1, r = n, ans = 0;
while(l <= r) {
int mid = (l + r) / 2;
if(check(mid)) {
l = mid + 1;
ans = mid;
} else r = mid - 1;
}
return ans;
}
//int main()
//{
// ios::sync_with_stdio(false);
// cout.tie(nullptr);
// cin.tie(nullptr);
// cin >> n >> m >> b;
// ff(i,1,n)cin >> niz[i];
//
// ff(i,1,n)pref[i] = pref[i - 1] + niz[i];
//
// int l = 1, r = n, ans = 0;
// while(l <= r){
// int mid = (l + r) / 2;
// if(check(mid)){
// l = mid + 1;
// ans = mid;
// }
// else r = mid - 1;
// }
//
// cout << ans << endl;
//
// return 0;
//}
///**
//
//5 20 6
//1 2 10 12 14
//
//// probati bojenje sahovski ili slicno
//
//**/
