This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
 
using LL = long long;
#include "ricehub.h"
int besthub(int R, int L, int X[], LL B) {
	vector<LL> sum(R + 1);
	for(int i = 0; i < R; i++)
		sum[i + 1] = sum[i] + X[i];
	auto get = [&](int l, int r) {
		int m = (l + r) / 2;
		return sum[r + 1] - sum[m] - X[m] * LL(r + 1 - m)
			 + X[m] * LL(m - l) - sum[m] + sum[l];
	};
	int p = 0, ans = 0;
	for(int i = 0; i < R; i++)
		while(p < R && get(i, p) <= B)
			ans = max(ans, p++ - i + 1);
	return ans;
}
| # | 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... |