PAT(甲级)1045
来源:互联网 发布:ios leancloud数据库 编辑:程序博客网 时间:2024/06/04 23:25
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>using namespace std;const int ROW = 201;const int COL = 10004;int map[ROW][COL];int order[ROW];int stripe[COL];int longest=0;int N,M,L;void display(int n1,int n2){for(int i=0;i<n1;i++){for(int j=0;j<n2;j++) cout <<map[i][j] <<' '; cout <<endl;}}int main(){//freopen("test.txt","r",stdin);//memset(map,false,sizeof(map))scanf("%d%d",&N,&M);for(int i=0;i<M;i++) scanf("%d",&order[i]);scanf("%d",&L);for(int i=0;i<L;i++) scanf("%d",&stripe[i]); int i,j; if(order[0] == stripe[0]) map[0][0] = 1; else map[0][0] = 0;for(j=1;j<L;j++){map[0][j] = map[0][j-1]; if(order[0] == stripe[j]) map[0][j]++;}for(i =1;i<M;i++) if(order[i] == stripe[0]) map[i][0] = 1; else map[i][0] = map[i-1][0];for(i=1;i<M;i++){ for(j=1;j<L;j++){ map[i][j] = map[i-1][j] > map[i][j-1] ? map[i-1][j]:map[i][j-1]; if(order[i] == stripe[j]) map[i][j]++; }}//display(M,L);printf("%d\n",map[M-1][L-1]); return 0;}
- PAT(甲级)1045
- *浙大PAT甲级 1045
- PAT甲级1045
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- ubuntu git安装
- ASP.NET中的几种弹出框提示基本实现方法
- Fliter设置字符编码,解决中文问题
- 快速开发一个PHP扩展
- JavaWeb学习笔记之表单数据处理类
- PAT(甲级)1045
- CAS 自定义数据源
- 软件测试中的性能指标
- test
- POJ 1207
- PAT(甲级)1046
- 【小牛分享】jquery mobile网页demo实例代码下载
- 基本算法研究1-冒泡排序算法测试
- HTML属性是什么?