bzoj1264

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<cmath>
 4 #include<ctime>
 5 #include<cstdlib>
 6 #include<iostream>
 7 #include<algorithm>
 8 #include<vector>
 9 #define lowbit(a) ((a)&(-(a)))
10 #define clr(a,x) memset(a,x,sizeof(a))
11 #define rep(i,l,r) for(int i=l;i<r;i++)
12 typedef long long ll;
13 using namespace std;
14 int read()
15 {
16     char c=getchar();
17     int ans=0,f=1;
18     while(!isdigit(c)){
19         if(c==‘-‘) f=-1;
20         c=getchar();
21     }
22     while(isdigit(c)){
23         ans=ans*10+c-‘0‘;
24         c=getchar();
25     }
26     return ans*f;
27 }
28 const int maxn=20009,maxl=100009;
29 vector<int>p[maxn];
30 int d[maxl],n,len;
31 int find(int a)
32 {
33     int ans=0;
34     while(a>0){
35         ans=max(d[a],ans);
36         a-=lowbit(a);
37     }
38     return ans;
39 }
40 void update(int a,int k)
41 {
42     while(a<=len){
43         d[a]=max(d[a],k);
44         a+=lowbit(a);
45     }
46 }
47 int main()
48 {
49     n=read();
50     len=n*5;
51     rep(i,0,len){
52         int t=read();
53         p[t].push_back(i+1);
54     }
55     rep(i,0,len){
56         int t=read();
57         for(int j=4;j>=0;j--){
58             int pos=p[t][j];
59             update(pos,find(pos-1)+1);
60         }
61     }
62     printf("%d\n",find(len));
63     return 0;
64 }