#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long sum[N];
long long get(int l, int r) {
int mid = (l + r) >> 1;
if ((r - l + 1) & 1) {
return sum[r] - sum[mid] - sum[mid - 1] + sum[l - 1];
}
else {
return sum[r] - sum[mid] - sum[mid] + sum[l - 1];
}
}
int besthub(int R, int L, int X[], long long B) {
for (int i = 1; i <= R; ++i) sum[i] = sum[i - 1] + X[i - 1];
int ptr = 0, res = 0;
for (int i = 1; i <= R; ++i) {
while (ptr <= R && get(i, ptr) <= B) ptr++;
res = max(res, ptr - i);
}
return res;
}
