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 "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B) {
int ans = 0;
int l = 0;
int r = 0;
for (int i = 0; i < R; i++) {
if (i > 0) {
B -= 1ll * (X[i] - X[i - 1]) * (i - l);
B += 1ll * (X[i] - X[i - 1]) * (r - i);
}
while (B < 0) {
B += X[i] - X[l];
l++;
}
while (r < R && B >= X[r] - X[i]) {
B -= X[r] - X[i];
r++;
}
while (r < R && B + X[i] - X[l] >= X[r] - X[i]) {
B += X[i] - X[l] - X[r] - X[i];
r++;
}
ans = max(ans, r - l);
}
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... |