【NOIP2016提高A组五校联考1】道路规划

Description

Solution

Code

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100007;
int i,j,k,l,t,n,m,ans;
int f[maxn],r,mid,c[maxn];
struct node{
int a,b;
}a[maxn];
bool cmp(node x,node y){
return x.a<y.a;
}
int main(){
//  freopen("fan.in","w",stdout);
scanf("%d",&n);
fo(i,1,n)scanf("%d",&k),a[k].a=i;
fo(i,1,n)scanf("%d",&k),a[k].b=i;
sort(a+1,a+1+n,cmp);
f[ans=1]=a[1].b;
fo(i,2,n){
if(a[i].b<f[ans]){
f[++ans]=a[i].b;
}
else{
l=1,r=ans;
while(l<r){
mid=(l+r)/2;
if(f[mid]>a[i].b)l=mid+1;else r=mid;
}
f[l]=a[i].b;
}
}
printf("%d\n",ans);
}