This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#import<cstdio>
int n,r[1000001],m[1000001],b,x,i;
main(){
scanf("%d",&n);
for(i=0;i<n;) scanf("%d",&b),r[b]=i++;
for(i=1;i<=n;i++)m[i]=(r[i]>r[i-1])?m[i-1]+1:1,(x<m[i])?x=m[i]:0;
printf("%d",n-x);
}
# | 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... |