PAT1045 Favorite Color Stripe
来源:互联网 发布:天津教育网络教研平台 编辑:程序博客网 时间:2024/05/22 17:11
OS: OS X 10.10.5
IDE:Xcode 7.2.1
//// main.cpp// MaxPublicSubSequence//// Created by achao on 4/14/16.// Copyright © 2016 achao All rights reserved.///* 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 NN (\le 200≤200) which is the total number of colors involved (and hence the colors are numbered from 1 to NN). Then the next line starts with a positive integer MM (\le 200≤200) followed by MM Eva's favorite color numbers given in her favorite order. Finally the third line starts with a positive integer LL (\le 10^4≤10 4 ) which is the length of the given stripe, followed by LL 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: 6 5 2 3 1 5 6 12 2 2 4 1 5 5 6 3 1 1 5 6 Sample Output: 7*/#include <iostream>#include <math.h>using namespace std;int main(int argc, const char * argv[]) { int N,M,L; scanf("%d",&N);scanf("%d",&M); int FavColor[M+1];FavColor[0]=0; for (int i=1; i<=M; i++) { scanf("%d",&FavColor[i]); } scanf("%d",&L); int Stripe[L+1];Stripe[0]=0; for (int i=1; i<=L; i++) { scanf("%d",&Stripe[i]); } int Table[M+1][L+1]; for (int i=0; i<=M; i++) { for (int j=0; j<=L; j++) { Table[i][j]=0; } } for (int i=1; i<=M; i++) { for (int j=1; j<=L; j++) { if (FavColor[i]==Stripe[j]) { Table[i][j]=max(Table[i-1][j],Table[i][j-1])+1; } else{ Table[i][j]=max(Table[i-1][j],Table[i][j-1]); } } } /* printf("\n"); for (int i=0; i<=M; i++) { for (int j=0; j<=L; j++) { printf("%d",Table[i][j]); } printf("\n"); }*/ printf("%d",Table[M][L]); return 0;}
0 0
- PAT1045 Favorite Color Stripe
- 1045. Favorite Color Stripe
- 1045. Favorite Color Stripe
- 1045.Favorite Color Stripe
- Favorite Color Stripe
- 1045. Favorite Color Stripe
- PAT_1045. Favorite Color Stripe
- pat 1045 Favorite Color Stripe
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- 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)
- 1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)
- C++中 vector、list、deque、set、map的底层实现
- 防卫导弹(最长下降子序列)
- Uva 442 Matrix Chain Multiplication
- 面试某公司前端关于javascript中this的总结
- 堆排序
- PAT1045 Favorite Color Stripe
- SAS中library是 excel引擎,LIBNAME STATEMENT
- Oracle卸载步骤
- SQL注入式攻击
- poj 【1321】
- java学习---JVM中的垃圾收集算法和Heap分区简记
- CentOS下使用命令行测试网速
- C#—结构与枚举
- c++ RAII