# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795909 | rainboy | 줄 세우기 (KOI13_jul) | C11 | 119 ms | 10900 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 1000000
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int ii[N];
int n, i, a, k_, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a), a--;
ii[a] = i;
}
k_ = k = 1;
for (a = 1; a < n; a++)
k_ = max(k_, k = (ii[a - 1] > ii[a] ? 0 : k) + 1);
printf("%d\n", n - k_);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |