#include "ricehub.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
int32_t besthub(int32_t n, int32_t len, int32_t x[], int cc)
{
int l = 1, r = n;
int ans;
vector <int> a(n + 1);
for (int i = 1; i <= n; i++) a[i] = x[i - 1];
vector <int> pref(n + 1);
for (int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + a[i];
}
while (l <= r) {
int mid = (l + r) / 2;
pii mn = {inf, inf};
for (int i = 1; i + mid - 1 <= n; i++) {
int left = i, right = i + mid - 1;
int center = (left + right) / 2;
int cost = (pref[right] - pref[center]) - (right - center) * a[center]
+ (center - left) * a[center] - (pref[center - 1] - pref[left - 1]);
mn = min(mn, {cost, center});
}
if (mn.first <= cc) {
l = mid + 1;
ans = mid;
}
else r =mid -1 ;
}
return ans;
}
