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 a[1000010],chk[1000010],s[1000010],mx;
int main(){
int i,n;
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d",&a[i]);
chk[a[i]]=1;
if(chk[a[i]-1])s[a[i]]=s[a[i]-1]+1;
if(mx<s[a[i]])mx=s[a[i]];
}
printf("%d",n-mx-1);
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... |