#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 2;
int n;
struct node1
{
int s;
int q;
}a[N];
struct node2
{
int s;
int q;
}b[N];
int f[N];
int maxn;
int main()
{
cin >> n;
for(int i = 1;i <= n; ++ i)
{
cin >> a[i].s;
a[i].q = i;
}
for(int i = 1;i <= n; ++ i)
{
cin >> b[i].s;
for(int j = 1;j <= n; ++ j)
if(a[j].s == b[i].s)
{
b[i].q = a[j].q;
break;
}
}
for(int i = 1;i <= n; ++ i)
{
int t = 0;
for(int j = i + 1;j <= n; ++ j)
if(b[i].q < b[j].q)
t ++;
f[i] = t + 1;
maxn = max(maxn , f[i]);
}
cout << maxn;
return 0;
}
阳历过了,但是#1 #3 #4 #5 #6 #7 WA #2 #8 #9 #10 TLE
求各位大佬帮忙调一下 Orz