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>
int N,I[1000100],U;
int main()
{
int i,x,l;
scanf ("%d",&N);
for (i=1;i<=N;i++){
scanf ("%d",&x);
I[x] = i;
}
U = l = 1;
for (i=2;i<=N;i++){
if (I[i-1] < I[i]) l++;
else l = 1;
if (U < l) U = l;
}
printf ("%d",N-U);
return 0;
}
# | 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... |