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>
#define ll long long
#include "ricehub.h"
//#include "grader.cpp"
using namespace std;
ll X[100010], qs[100010];
int besthub(int R, int L, int _X[], ll B) {
for (int i = 1; i <= R; ++i) X[i] = _X[i-1];
for (int i = 1; i <= R; ++i) qs[i] = qs[i-1] + X[i];
ll l = 1, r = R;
while (l < r) {
ll mid = (l+r+1)/2;
bool y = 0;
for (ll i = 1, j = mid; j <= R; ++i, ++j) {
ll md = (i+j)/2;
if (qs[j]-qs[md]-(j-md)*X[md] + (md-l)*X[md]-qs[md-1]-qs[i-1] <= B) y = 1;
}
if (y) l = mid;
else r = mid-1;
}
return l;
}
# | 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... |