PAT-A-1045. Favorite Color Stripe (30)
来源:互联网 发布:西蒙斯面补数据 编辑:程序博客网 时间:2024/05/16 15:52
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 (<=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:65 2 3 1 5 612 2 2 4 1 5 5 6 3 1 1 5 6Sample Output:
7
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;const int maxn = 10010;int f[210];int dp[maxn];int a[maxn];int hashtable[210] = { 0 };int main(){ int colar; int n, m; cin >> colar >> n; for (int i = 1; i <= n; i++) { cin >> f[i]; hashtable[f[i]] = i; } cin >> m; int c; int num = 0; for (int i = 0; i < m; i++) { cin >> c; if (hashtable[c] >0) { a[num++] = hashtable[c]; } } int ans = -1; for (int i = 0; i < num; i++) { dp[i] = 1; for (int j = 0; j < i; j++) { if (a[i] >= a[j] && dp[j] + 1>dp[i]) dp[i] = dp[j] + 1; } ans = max(ans, dp[i]); } cout << ans << endl; system("pause"); return 0;}
- PAT A 1045. Favorite Color Stripe (30)
- PAT-A-1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)-PAT
- PAT 1045. Favorite Color Stripe (30)
- PAT 1045. Favorite Color Stripe (30)
- PAT 1045. Favorite Color Stripe (30)
- 【PAT】1045. Favorite Color Stripe (30)
- [pat]1045. Favorite Color Stripe (30)
- 【PAT甲级】1045. Favorite Color Stripe (30)
- PAT甲级1045. Favorite Color Stripe (30)
- PAT 甲级 1045. Favorite Color Stripe (30)
- PAT甲级 1045. Favorite Color Stripe (30)
- PAT 1045. Favorite Color Stripe
- PAT 1045. Favorite Color Stripe
- PAT 1045. Favorite Color Stripe
- 【PAT】1045. Favorite Color Stripe
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- Oracle数据迁移优化
- Test!
- 程序打包
- 双表头测试
- 在前端开发使用Bootstrap框架
- PAT-A-1045. Favorite Color Stripe (30)
- 一个查了6个小时的问题的解决过程
- 416. Partition Equal Subset Sum(第十六周)
- 突破微信服务号群发限制
- py函数
- C语言算术运算中数据类型的自动转换
- 数码照片管理
- FTP文件管理模块
- 电子地图