1045 Favorite Color Stripe （30 分）（最长公共子序列变形）

最新推荐文章于 2022-08-05 12:49:56 发布

galesaur_wcy

最新推荐文章于 2022-08-05 12:49:56 发布

阅读量538

点赞数 1

分类专栏： PAT甲级题

本文链接：https://blog.csdn.net/galesaur_wcy/article/details/84789292

版权

PAT甲级题专栏收录该内容

145 篇文章 3 订阅

订阅专栏

Eva正尝试从给定的颜色条纹中，仅保留她最喜爱的颜色，并以最大长度重组形成新的条纹。面对可能非常长的原始条纹，Eva需要帮助来找到最佳解决方案，即保留喜爱颜色的最长连续段。此问题类似最长公共子序列问题的变形。

摘要由CSDN通过智能技术生成

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 (≤104) 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:

真的是。。。最长公共子序列变形。。嘤嘤嘤~~~

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int vis[205];
int col[205];
int dd[maxn], dp[maxn];
int main()
{
	int k ;
	scanf("%d", &k);
	int n, m ;
	scanf("%d", &n);
	int gg = 0;
	for(int i = 1; i <= n ;i ++)
	{
		scanf("%d",&col[i]);
		vis[col[i]] = ++gg;
	}
	scanf("%d",&m);
	int x,now = 0;
	for(int i = 1; i <= m ; i ++)
	{
		scanf("%d", &x);
		if(vis[x] >= 1)
			dd[++now] = vis[x];
	}
	//接下来这边应该是最长公共子序列 不过可以重复？ 
	int maxn = 0; 
	for(int i = 1; i <= now; i ++)
	{
		dp[i] = 1;	
		for(int j = 1; j < i; j ++)
		{
			if(dd[i] >= dd[j])
				dp[i] = max(dp[i],dp[j] + 1);
		}
		maxn = max(maxn,dp[i]);
//		printf("dp[%d] = %d\n",i,dp[i]);
	}
	printf("%d\n",maxn);
	return 0;
}