#include "ricehub.h"
int besthub(int n, int _, int a[], long long b) {
long long p[n + 1]; p[0] = 0; for (int i = 1; i <= n; i++) p[i] = a[i - 1] + p[i - 1]; int r = 0, m = 0, w = 0;
for (int l = 1, u = 1, v = n; l <= n; l++, u = l, v = n) while (u <= v) m = (u + v) / 2, w = (a[l + (m - l) / 2 - 1] * (2 * (l + (m - l) / 2) + 1 - l - m) + (p[m] + p[l - 1] - 2 * p[l + (m - l) / 2]) <= b), r = w ? ((r > m - l + 1) ? r : m - l + 1) : r, u = w ? (m + 1) : u, v = !w ? (m - 1) : v;
return r;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |