# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157578 | RoundMango | Rice Hub (IOI11_ricehub) | C++14 | 5 ms | 632 KiB |
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;
long long a[100005], ans, sum[100005];
long long b;
int besthub(int R, int L, int a[], long long b) {
long long n, m, l, r, md, mx, ans;
for (int i = 1; i <= R; i++)
sum[i] = sum[i-1] + a[i];
l = 1; r = R;
while (l < r) {
md = (l+r+1)>>1;
for (int i = md; i <= R; i++) {
long long xx;
ans = 1e10;
n = i-md+1;
mx = (n+i+1)>>1;
xx = sum[i] - sum[mx] - (i-mx)*a[mx] + a[mx]*(mx-n) - sum[mx-1] + sum[n-1];
ans = min(ans,xx);
}
if (ans <= b) l = md;
else r = md-1;
}
return l;
}
Compilation message (stderr)
# | 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... |