PAT甲级1045. Favorite Color Stripe (30)
来源:互联网 发布:lovelive舞蹈教学 知乎 编辑:程序博客网 时间:2024/06/05 15:03
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:
6
5 2 3 1 5 6
12 2 2 4 1 5 5 6 3 1 1 5 6
Sample Output:
7
就是一个最长上升子序列(LIS)问题。
http://www.acmerblog.com/dp-3-longest-increasing-subsequence-4640.html
#include <cstdio>using namespace std;#include <vector> const int MAX=200+10;int favorite[MAX];int main(){ int N,M,L; scanf("%d",&N); for(int i=0;i<=N;i++) favorite[i]=-1; scanf("%d",&M); int x; for(int i=0;i<M;i++){ scanf("%d",&x); favorite[x]=i; } scanf("%d",&L); vector<int> stripe; for(int i=0;i<L;i++){ scanf("%d",&x); if(favorite[x]>=0) stripe.push_back(x); } int n=stripe.size(); vector<int> dp(n,1); for(int i=0;i<n;i++){ for(int j=0;j<i;j++){ if(favorite[stripe[j]]<=favorite[stripe[i]]) { if(dp[j]+1>dp[i]) dp[i]=dp[j]+1; } } } int maxLen=0; for(int i=0;i<n;i++){ if(dp[i]>maxLen) maxLen=dp[i]; } printf("%d",maxLen); return 0;}
- 【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
- 1045. Favorite Color Stripe (30)-PAT甲级真题
- PAT甲级练习1045. Favorite Color Stripe (30)
- 1045. Favorite Color Stripe (30)-PAT甲级真题
- 1045. Favorite Color Stripe (30)-PAT
- PAT A 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-A-1045. Favorite Color Stripe (30)
- PAT 1045. Favorite Color Stripe
- PAT 1045. Favorite Color Stripe
- MySQL安装详解
- Qt中实现将float类型转换为QString类型
- 利用ns3做full duplex仿真的参考资料
- 2017pycharm 3.2 激活码
- 机器学习中的有监督学习,无监督学习,半监督学习的区别
- PAT甲级1045. Favorite Color Stripe (30)
- 欢迎使用CSDN-markdown编辑器
- Android随时随地退出应用程序
- 几个重要的 ASM Disk Groups 参数
- Fastlane的sigh指令
- c++第二次实验-6质数输出
- Array比较好用的属性和方法
- 如何评价分类模型性能?(附带参考文献)
- Java中getResourceAsStream的用法