Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- long long i,j,ans=0,n,a[200005],b[200005],maxx=1;
- map<long,long> c;
- cin>>n;
- for(i=0;i<n;i++)
- cin>>a[i];
- for(i=0;i<n;i++){
- cin>>b[i];
- c[b[i]]=i;
- b[i]=i;
- }
- for(i=0;i<n;i++){
- a[i]=c[a[i]];
- }
- ans=1;
- for(i=0;i<n-1;i++){
- if(a[i+1]>a[i]){
- ans++;
- maxx=max(maxx,ans);
- }
- else{
- ans=1;
- }
- }
- cout<<n-maxx<<endl;
- }
Add Comment
Please, Sign In to add comment