1045. Favorite Color Stripe (30)——PAT (Advanced Level) Practise
2015-12-06 21:10
369 查看
题目信息
1045. Favorite Color Stripe (30)时间限制200 ms
内存限制65536 kB
代码长度限制16000 B
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 (<=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.
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
解题思路
最长公共子序列变种AC代码
#include <cstdio> #include <algorithm> using namespace std; int mp[205], dp[205]; int main() { int N, M, L, t; scanf("%d", &N); scanf("%d", &M); for (int i = 0; i < M; ++i){ scanf("%d", &t); mp[t] = i + 1; } scanf("%d", &L); for (int i = 0; i < L; ++i){ scanf("%d", &t); if (mp[t] != 0){ int tm = 0, tl = 0; while (++tl <= mp[t]){ tm = max(tm, dp[tl]); } dp[mp[t]] = tm + 1; } } int mx = dp[1]; for (int i = 2; i <= M; ++i){ mx = max(mx, dp[i]); } printf("%d\n", mx); return 0; }
相关文章推荐
- mysql常见的错误提示问题处理小结
- Windows下MySql错误代码1045的解决方法
- N天测试网络视频会议系统
- libdvbpsi源码分析(四)PAT表解析/重建
- PAT配置
- 什么是端口复用动态地址转换(PAT) 介绍配置实例
- MikroTik layer7-protocol
- PAT是如何工作的
- 最长公共字串
- PAT 乙级题:1002. 写出这个数 (20)
- PAT (Advanced Level) Practise 1001-1010
- 数据结构学习与实验指导(一)
- DP问题各种模型的状态转移方程
- LCS 最长公共子序列
- PAT Basic Level 1001-1010解题报告
- 1001. 害死人不偿命的(3n+1)猜想
- 1002. 写出这个数
- 1032. 挖掘机技术哪家强
- 1001. 害死人不偿命的(3n+1)猜想 (PAT basic)
- 1002. 写出这个数(PAT Basic)