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}.

 

输入描述:

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 (<=10000) which is the length of the given stripe, followed by L colors on the stripe.  All the numbers in a line are separated by a space.

输出描述:

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

 

输入例子:

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

 

输出例子:

7

2、思路

每次遇到这种题目我都会惧怕，好像动态规划是我天生的克星，但是通过这道题，我仿佛理解了有关最长公共子序列的一些原理。

给定一个长序列，和短序列，我们要在长序列里面寻找与短序列能够匹配的最大长度！！！

以短序列为核心，扫描长序列，如果扫描到的地方刚好在短序列存在，那么看看扫描到的地方以及该地方之前的最大匹配了多少，假设为max，那么新的匹配就是扫描到的该地方=max + 1；

做完所有长序列，扫描短序列，看看到哪个位置能匹配到最多！

3、代码 

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 300,M = 1e4 + 10;
int c[N],f[M];
int dp[N];
int main()
{
	int n,m,l;
	scanf("%d",&n);
	scanf("%d",&m);
	for(int i = 1;i<=m;i++) scanf("%d",&c[i]);// 输入短序列 
	scanf("%d",&l);
	for(int i = 1;i<=l;i++) scanf("%d",&f[i]);// 输入长序列 
	for(int i = 1;i<=l;i++)
	{
		int ans = -1;
		for(int j = 1;j<=m;j++)
		{
			if(f[i]==c[j])
			{
				for(int k = 1;k<=j;k++) ans = max(ans,dp[c[k]]);// 更新匹配的值 
				dp[c[j]] = ans + 1;
			}
		}
	}
	int res = -1;
	for(int i = 1;i<=m;i++)
		res = max(res,dp[c[i]]);
	printf("%d\n",res);
	return 0;
}