#include "ricehub.h" #include <cstdlib> #include <iostream> #define dist(a,b)abs(X[a]-X[b]) bool ishub(int R, int X[], long long B, int A) { if (A==1) return true; int M = A/2,I=-1,C=0; while (++I<A)C+=dist(I,M); --I;while (C>B&&++I<R) { C-=dist(I-A, M); if ((A&1)==0) C-=dist(M, M+1); C+=dist(I, ++M); } return C<=B; } int besthub(int R, int L, int X[], long long B) { int P=2,K=R+1; while (P<K) { auto M = (P+K)/2; if (ishub(R, X, B, M)) P=M+1; else K=M; } return --P; }