1045. Favorite Color Stripe (30)
来源:互联网 发布:2017年快餐行业数据 编辑:程序博客网 时间:2024/06/08 19:03
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 <cstring>using namespace std;#define maxn 10005int book[maxn],num[maxn];int main(){ int n,m; cin>>n>>m; for(int i = 1;i <= m ; i++) { int x; cin>>x; book[x] = i; } int k; cin>>k; int cnt = 0; for(int i = 1; i <= k; i++) { int x; cin>>x; if(book[x] >= 1) num[cnt++] = x; } int dp[maxn]={0}; int maxnlen = -1; for(int i = 0; i < cnt; i++) { dp[i] = 1; for(int j = 0; j < i; j++) { if(book[num[i]] >= book[num[j]]) dp[i] = max(dp[i], dp[j]+1); } if(maxnlen < dp[i]) maxnlen = dp[i]; } cout<<maxnlen;}
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- eclipse
- 对XML进行解释
- sql server 带有OUTPUT的INSERT,DELETE,UPDATE
- Matlib 关于视屏处理的方法
- UVa 732
- 1045. Favorite Color Stripe (30)
- Django数据库操作
- 最大值和最小值
- STM32的时钟系统RCC详细整理
- 例题6-17 看图写树(Undraw the Trees, UVa 10562)
- 201612-2CSP工资计算
- 51nod 1095 Anigram单词
- 文件IO和标准IO的比较
- C语言数据结构应用(图书借阅系统)