| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 5986 | kriii | Rice Hub (IOI11_ricehub) | C++98 | 20 ms | 4992 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.
int besthub(int R, int L, int *X, long long B)
{
int A = 0; long long S = 0;
for (int i=0,j=0;j<R;j++){
for (S+=X[j]-X[(i+j)/2];S>B;i++) S-=X[(i+j+1)/2]-X[i];
if (A < j - i) A = j - i;
}
return ++A;
}| # | 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... | ||||
