#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
bool can(int n, int mid, long long b, long long pfs[])
{
bool can = false;
if (mid & 1) {
for (int i = mid; i <= n; i++) {
long long sum = pfs[i] - pfs[i - mid / 2] - pfs[i - mid / 2 + 1] + pfs[i - mid];
if (sum <= b) {
can = true;
break;
}
}
}
else {
for (int i = mid; i <= n; i++) {
long long sum = pfs[i] - pfs[i - mid / 2] - pfs[i - mid / 2] + pfs[i - mid];
if (sum <= b) {
can = true;
break;
}
}
}
return !can;
}
int besthub(int n, int k, int arr[], long long b)
{
long long pfs[n + 1] = {0};
for (int i = 1; i <= n; i++) pfs[i] = pfs[i - 1] + arr[i - 1];
int l = 0;
int r = n - 1;
while (r > l) {
int mid = (r + l) >> 1;
if (can(n, mid, b, pfs)) r = mid;
else l = mid + 1;
}
return l - 1;
}
