# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
829469 | rainboy | Airplane (NOI23_airplane) | C11 | 22 ms | 2948 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 <stdio.h>
#define N 200000
#define M 400000
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N];
int n, m, i, x, y;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
x = 0;
for (i = 0; i < n; i++)
x = max(x, aa[i] - i);
y = 0;
for (i = 0; i < n; i++)
y = max(y, aa[i] - (n - 1 - i));
printf("%d\n", n - 1 + x + y);
return 0;
}
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... |