PAT A1045 Favorite Color Stripe

Description:

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 (≤10410^4) which is the length of the given stripe, followed by L 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

思路:

动态规划的最长不下降子序列问题

AC代码:

#include <stdio.h>
#define max 210

int main()
{
    //freopen("input.txt","r",stdin);
    int favorite[max];
    int N,M,L,temp;
    for(int i=0;i<max;i++)
        favorite[i]=300;//元素越大,优先级越低,取大于200的数即可
    scanf("%d",&N);//读入N
    scanf("%d",&M);//一共M种喜欢的颜色
    for(int i=0;i<M;i++)
    {
        scanf("%d",&temp);
        favorite[temp]=i;//设置优先级
    }
    scanf("%d",&L);
    int A[L];//
    int dp[L];
    for(int i=0;i<L;i++)
    {
        scanf("%d",A+i);
        if(favorite[A[i]]<M)dp[i]=1;
        else dp[i]=0;
    }//获得stripe数组和dp数组
    int k=0;
    for(int i=1;i<L;i++)
    {
        for(int j=0;j<i;j++)
        {
            if(favorite[A[i]]<M&&favorite[A[j]]<=favorite[A[i]]&&dp[i]<dp[j]+1)
            {//必须是喜欢的颜色故favorite[A[i]]<M
                dp[i]=dp[j]+1;
            }
        }//每次循环确定一个dp[i]
        if(dp[i]>dp[k])k=i;
    }
    printf("%d",dp[k]);
}

发布了82 篇原创文章 · 获赞 1 · 访问量 1580
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览