#include "ricehub.h" #include <bits/stdc++.h> #define ll long long using namespace std; ll pf[111111]; ll f(int l, int r){ l++; r++; ll md = (l + r) / 2, c = pf[md] - pf[md - 1]; return (c * (md - l) - (pf[md - 1] - pf[l - 1])) + ((pf[r] - pf[md]) - c * (r - md)); } int besthub(int N, int K, int X[], long long B){ int l = 0, r = 0; for(int i = 1;i<=N;i++){ pf[i] = pf[i - 1] + X[i - 1]; } int ans = 0; while(r < N){ while(f(l, r) > B) l++; ans = max(ans, r - l + 1); r++; } return ans; }