#include "bits/stdc++.h" #include "ricehub.h" // #include "grader.cpp" using namespace std; int besthub(int R, int L, int X[], long long B) { int l = 1, r = R, ans = 0; while(l <= r) { int mid = (l + r) / 2, ok = 0; for(int i = 0; i < R; i++) { if(i + 1 >= mid) { int l1 = X[i - mid + 1], r1 = X[i]; int p = (l1 + r1) / 2; if((p - X[i - mid + 1]) + (X[i] - X[i - mid + 1]) <= B) { ok = 1; break; } } } if(ok) { l = mid + 1; ans = mid; } else r = mid - 1; } return ans; }