1045 Favorite Color Stripe （30 分）

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

题意：在最喜欢的颜色中，求最大lsa问题，dp的裸板子

题解：去掉不要的颜色，求lsa问题

#include<iostream>
#include<vector>
using namespace std;
int book[201]/*标记原数组中有哪些数*/,a[10001]/*存储原数组中有的数*/,dp[10001];
int main()
{
    int n,m,x,l,num=0,maxn=0;
    scanf("%d %d",&n,&m);
    
    for(int i=1;i<=n;i++)//把出现过的每个数扫一遍，标记一下 
    {
    	scanf("%d",&x);
    	book[x]=i;
	}
     cin>>l;
	 
	 for(int i=0;i<l;i++)
	 {
	 	cin>>x;
	 	if(book[x]>=1)
	 	   a[num++]=book[x]; 	
	 } 
 
     for(int i=0;i<num;i++)
     {//裸的lsa  dp算法 
     	dp[i]=1;
     	for(int j=0;j<i;j++)
     	    if(a[i]>=a[j])
     	        dp[i]=max(dp[i],dp[j]+1);
     	
        maxn=max(dp[i],maxn);	
	 }
 
  printf("%d", maxn);
    return 0;
 
}