【PAT】A1045 Favorite Color Stripe【最长不下降子序列】

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

题意

给出一串序列A，该序列中的数字从左到右权值依次增大。
再给出一串序列B，剔除不在序列A中的数字后，求序列B的最长不下降子序列（按照序列A中的权值大小关系）。

思路

首先读取序列A，然后将序列B中不属于序列A的元素剔除，将读入的元素直接转化为权值方便处理。然后使用LIS算法套模板。这是典型的动态规划问题，我们划分子问题的方法在于dp[i]代表以a[i]为结尾的子序列，对于j < i，如果a[i] >= a[j]且dp[j] + 1 > dp[i]，也就是说在以a[j]为结尾的子序列后面加上ai，比现有的以ai为结尾的子序列要长，我们就更新dp[i]。这样我们将j从0到i-1考虑（首先假设0~i - 1的结果已经算