| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 402312 | rainboy | Rice Hub (IOI11_ricehub) | C11 | 19 ms | 1736 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"
int max(int a, int b) { return a > b ? a : b; }
int besthub(int n, int L, int *xx, long long d) {
int i, j, k;
k = 0;
for (i = 0, j = 0; j < n; j++) {
d -= xx[j] - xx[(i + j) / 2];
while (d < 0)
d += xx[(i + 1 + j) / 2] - xx[i], i++;
k = max(k, j - i + 1);
}
return k;
}| # | 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... | ||||
