#include "ricehub.h" int max(int a, int b) { return a > b ? a : b; } int besthub(int n, int L, int *xx, long long d) { int i, j, k; k = 0; for (i = 0, j = 0; j < n; j++) { d -= xx[j] - xx[(i + j) / 2]; while (d < 0) d += xx[(i + 1 + j) / 2] - xx[i], i++; k = max(k, j - i + 1); } return k; }