pat 1045
来源:互联网 发布:java中random怎么用 编辑:程序博客网 时间:2024/06/05 02:15
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 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:65 2 3 1 5 612 2 2 4 1 5 5 6 3 1 1 5 6Sample Output:
7
//DP还是不会啊#include <stdio.h>int favCol[210], oriCol[10010];int dp[10010];int main(){int i, j, tmp, count, max = -1;int n, m, l;scanf("%d", &n);scanf("%d", &m);for(i = 1; i <= n; i++)favCol[i] = -1;for(i = 1; i <= m; i++){scanf("%d", &tmp);favCol[tmp] = i;}scanf("%d", &l);for(i = 1, count = 1; i <= l; i++){scanf("%d", &tmp);if(favCol[tmp] != -1)oriCol[count++] = favCol[tmp];}l = count - 1;//求最长递增子序列for(i = 1; i <= l; i++){dp[i] = 1;for(j = 1; j < i; j++)if(oriCol[i] >= oriCol[j] && (dp[j] + 1) > dp[i])dp[i] = dp[j] + 1;if(dp[i] > max)max = dp[i];}printf("%d\n", max);return 0;}
- pat 1045
- pat 1045
- pat 1045
- PAT Advanced Level 1045
- PAT.1035-1045
- PAT(甲级)1045
- PAT 1045 快速排序
- *浙大PAT甲级 1045
- PAT乙级1045
- pat-bl-1045
- PAT甲级1045
- PAT乙级1041-1045
- PAT basic 1045
- pat
- 【PAT】
- PAT
- PAT
- PAT
- iscroll.js用法
- 达芬奇平台-EMCV移植和测试
- HTML标签用法,这样去写你的 HTML
- spring的IoC初始化和依赖注入
- 启动ssh服务时,提示Could not load host key: /etc/ssh/ssh_host_rsa_key
- pat 1045
- oracle中 rownum和rowid的用法
- Android中常用适配器及定义自己的适配器
- ANDROID性能调优
- BF算法和KMP算法对比
- [cocos2dx 3.0 (一)] 对文件读写操作 +FileUtils类
- CF 229B. Planets
- 从Mysql到系统权限
- [linux+c]C语言题目(一)