1045. Favorite Color Stripe (30)
来源:互联网 发布:短网址生成源码 编辑:程序博客网 时间:2024/06/07 05:35
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<stdio.h>#include<stdlib.h>#include<math.h>#include<limits.h>int color[210];int a[10010];int b[10010];int max(int x, int y){return x > y ? x : y;}int main(){int N, M, L;int i, j, temp;int index = 0;int m;//freopen("d:\\input.txt", "r", stdin);scanf("%d%d", &N, &M);for (i = 1; i <= M; ++i){scanf("%d", &temp);color[temp] = i;}scanf("%d", &L);for (i = 0; i < L; ++i){scanf("%d", &temp);if (color[temp] != 0){a[index++] = temp;}}for (i = 0; i < index; ++i){b[i] = 1;for (j = 0; j < i; ++j){if (color[a[i]] >= color[a[j]]){b[i] = max(b[i], b[j] + 1);}}}m = 0;for (i = 0; i < index; ++i){m = max(b[i], m);}printf("%d\n", m);return 0;}
- 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)
- shell脚本之判断输入参数是否为整数值
- bzoj 4725: [POI2017]Reprezentacje ró?nicowe 暴力
- HTTP Content-Type类型
- Hendler 常用方法(二)
- Leetcode 148 SortList
- 1045. Favorite Color Stripe (30)
- 下载yahoo股票历史数据
- redis的事务
- OpenCV学习笔记三(2016年12月4日)像素值的读写
- u-boot-2016.11移植nandfalsh(基于s5pv210)
- 计算器小程序与衍生问题
- 线程实现并发服务器
- 合理加锁保持线程代码安全且保证性能
- 吴山广场