还是想了一下,把b[]翻转得到了LCS模型,转LIS即可
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,ans;
int v[50005],a[50005];
int best[50005];
int find(int x)
{
int t=0,l=1,r=ans;
while(l<=r)
{
int mid=(l+r)>>1;
if(best[mid]<x)l=mid+1,t=mid;
else r=mid-1;
}
return t;
}
void dp()
{
memset(best,127/3,sizeof(best));
best[0]=0;
for(int i=1;i<=n;i++)
{
int t=find(v[i])+1;
best[t]=min(best[t],v[i]);
ans=max(ans,t);
}
}
int main()
{
//freopen("formation.in","r",stdin);
//freopen("formation.out","w",stdout);
n=read();
for(int i=1;i<=n;i++)a[read()]=i;
for(int i=1;i<=n;i++)v[i]=a[read()];
dp();
printf("%d",ans);
return 0;
}