#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll pref[100010];
ll sum(int i, int j){ return pref[j+1]-pref[i]; }
int besthub(int n, int m, int a[], ll k)
{
pref[0] = 0;
for(int i = 0; i < n; i++)
pref[i+1] = pref[i]+(ll)a[i];
int l = 1, r = n;
while(l<r){
int mid = (l+r+1)/2; ll mn = (ll)4e18;
for(int i = 0; i <= n-mid; i++){
int j = i+mid-1; int med = (i+j)/2; int x = med;
ll sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
ll sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2); int cnt = 20;
while(med-1>=i and cnt--){
med--;
sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2);
}
cnt = 20, med = x;
while(med+1<=j and cnt--){
med++;
sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2);
}
}
if(mn<=k) l=mid;
else r = mid-1;
}
return l;
}
