# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
263341 | Berted | Rice Hub (IOI11_ricehub) | C++14 | 22 ms | 2560 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 "ricehub.h"
#include <iostream>
#define ll long long
using namespace std;
ll pref[100001];
int besthub(int R, int L, int X[], ll B)
{
int ret = 0;
for (int i = 1; i <= R; i++) pref[i] = pref[i - 1] + X[i - 1];
int rg = 0; ll s = 0;
for (int lf = 1; lf <= R; lf++)
{
rg = max(lf, rg);
int md = lf + rg >> 1;
s = pref[rg] - pref[md] - (pref[md - ((lf - rg + 1) & 1)] - pref[lf - 1]);
while (rg <= R && s <= B)
{
rg++; md = lf + rg >> 1;
s = pref[rg] - pref[md] - (pref[md - ((lf - rg + 1) & 1)] - pref[lf - 1]);
}
ret = max(ret, rg - lf);
}
return ret;
}
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... |