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

 思路:題意要求在"the given stripe"中找出最長的顏色子序列使其中的"color numbers"排列次序符合"Eva's favorite order", 那麼不妨假設"Eva's favorite order"中每個"color number" 的下標是其對應的權值, 而在"the given stripe"找最長的顏色子序列相當於找一個最長不遞減子序列.

程式碼

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int Max=1e4+5;
int main()
{
    int N,M,L,x;
    int Arr[Max],Stripe[250];
    memset(Stripe,0,sizeof(Stripe));
    scanf("%d %d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d",&x);
        Stripe[x]=i;
    }
    scanf("%d",&L);
    vector<int> v;
    for(int i=1;i<=L;i++)
    {
        scanf("%d",&Arr[i]);
        if(Stripe[Arr[i]])
        {
            if(v.empty())
                v.push_back(Stripe[Arr[i]]);
            else
            {
                int Len=v.size();
                if(Stripe[Arr[i]]>=v[Len-1])
                    v.push_back(Stripe[Arr[i]]);
                else
                {
                    int index=upper_bound(v.begin(),v.end(),Stripe[Arr[i]])-v.begin();
                    v[index]=Stripe[Arr[i]];
                }
            }
        }
    }
    printf("%d",v.size());
    return 0;
}