最长不下降子序列（推广问题）

最长不下降子序列问题的定义：在一个序列中，找到一个最长的子序列，其中这个序列是非递减的

我们可以把这个非递减推广，其实非递减就是一种顺序，那么我们可以把定义推广到：给出一个顺序序列、目标序列中，在目标序列中找到一个最长的子序列，其中这个子序列是符合给出顺序的子序列

---

解决这个推广的问题， 

我们可以把这个顺序序列的每一个元素映射到一个递增序列

假设顺序序列为X、Y、Z，那么我们可以把它映射到 0、1、2（用Hash表实现）

然后目标序列为 XYXXZXYZ，我们从上面的Hash表中找到它对应的序列为01002012

现在，问题就转化为最长不下降子序列了

下面的题目可以练练手

---

1045 Favorite Color Stripe (30 point(s))

Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pieces and sewing the remaining parts together to form her favorite color stripe.

It is said that a normal human eye can distinguish about less than 200 different colors, so Eva's favorite colors are limited. However the original stripe could be very long, and Eva would like to have the remaining favorite stripe with the maximum length. So she needs your help to find her the best result.

Note that the solution might not be unique, but you only have to tell her the maximum length. For example, given a stripe of colors {2 2 4 1 5 5 6 3 1 1 5 6}. If Eva's favorite colors are given in her favorite order as {2 3 1 5 6}, then she has 4 possible best solutions {2 2 1 1 1 5 6}, {2 2 1 5 5 5 6}, {2 2 1 5 5 6 6}, and {2 2 3 1 1 5 6}.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤200) which is the total number of colors involved (and hence the colors are numbered from 1 to N). Then the next line starts with a positive integer M (≤200) followed by M Eva's favorite color numbers given in her favorite order. Finally the third line starts with a positive integer L (≤10​4​​) which is the length of the given stripe, followed by L colors on the stripe. All the numbers in a line a separated by a space.

Output Specification:

For each test case, simply print in a line the maximum length of Eva's favorite stripe.

Sample Input:

6
5 2 3 1 5 6
12 2 2 4 1 5 5 6 3 1 1 5 6

Sample Output:

7