【剑指紫金港】1045 Favorite Color Stripe 贪心

A 1045 Favorite Color Stripe

题目链接

Problem Description

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

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

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

题目大意：

给定一个序列（序列中无重复值），求另一个序列中，保持这个序列顺序规律的最长子序列长度。

AC代码

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,k,ans=0,now;
	scanf("%d",&n);
	vector<int>dp(n+1,0);
	vector<int>vis(n+1,-1);
	scanf("%d",&m);
	vector<int>a(m);
	for(int i=0;i<m;i++){
		scanf("%d",&a[i]);
		vis[a[i]]=i;
	}
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		scanf("%d",&now);
		if(vis[now]<0) continue;
		int nex=0;
		for(int j=0;j<=vis[now];j++){
			nex=max(nex,dp[a[j]]+1);
		}
		dp[now]=nex;
		ans=max(dp[now],ans);
	}
	printf("%d",ans);
	return 0;
}