zoukankan      html  css  js  c++  java
  • PAT1045. Favorite Color Stripe

    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

    代码

     1 #include <cstdio>
     2 #include <cstring>
     3 bool have[202];
     4 bool order[202][202];
     5 int stripe[10002];
     6 int dp[10002];
     7 int max(int a,int b){return a > b ? a : b;}
     8 int main(){
     9     int colorNum,orderNum,stripeNum;
    10     scanf("%d%d",&colorNum,&orderNum);
    11     int seq[202];
    12     for(int i = 0;i < orderNum;i++)scanf("%d",&seq[i]);
    13     scanf("%d",&stripeNum);
    14     for(int i = 1;i <= stripeNum;i++)scanf("%d",&stripe[i]);
    15     //order数组记录的是i在Eva喜欢的序列中是否在j的前面
    16     //如果i或j不是Eva喜欢的颜色order[i][j]为0,并且i可以等于j
    17     for(int i = 0;i < orderNum;i++)
    18     for(int j = i;j < orderNum;j++)
    19         order[seq[i]][seq[j]] = 1;
    20     //have数组记录的是 是否是Eva喜欢的颜色
    21     for(int i = 0;i < orderNum;i++)
    22         have[seq[i]] = 1;
    23     //处理方式和最长递增子序列相似
    24     for(int i = 1;i <= stripeNum;i++){
    25         int tmax = 0;
    26         if(have[stripe[i]])tmax = 1;
    27         for(int j = 1;j < i;j++)
    28             if(order[stripe[j]][stripe[i]]){
    29                  tmax = max(dp[j]+1,tmax);
    30             }
    31         dp[i] = tmax;
    32     }
    33     int ans = 0;
    34     for(int i = 1;i <= stripeNum;i++)
    35         ans = max(ans,dp[i]);
    36     printf("%d",ans);
    37 }
  • 相关阅读:
    Struts 2
    spring中的发布订阅
    win10 安装mysql5.7.36
    Spring Boot如何使用HikariCP连接池详解
    ascii 和 byte以及UTF-8的转码规则
    计算机基础之 二进制与十进制
    VMWare VMNet 8 的配置使用
    IDEA中运行kotlin程序报错:Cannot inline bytecode built with JVM target 1.8 into bytecode that is being built with JVM target 1.6
    在Kotlin中使用Kotlin/java注解及注意事项
    关于Vue2.0,Express实现的简单跨域
  • 原文地址:https://www.cnblogs.com/starryxsky/p/7127684.html
Copyright © 2011-2022 走看看