【题解】【PAT甲】1045 Favorite Color Stripe（30分）（动态规划）（最长不上升子序列）

最新推荐文章于 2023-11-10 20:38:26 发布

原创

最新推荐文章于 2023-11-10 20:38:26 发布 · 369 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #动态规划

该博客介绍了一道程序设计题目，要求从给定的颜色序列中找到符合特定顺序的最长子序列。博主通过将问题转化为最长不上升子序列（LIS）问题来解决，并给出了详细的解题思路和代码实现。具体步骤包括建立颜色到位置的映射，筛选目标序列，然后计算LIS。最后博主提供了测试案例和输出结果。

题目链接

PTA | 程序设计类实验辅助教学平台

题目描述

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