zoukankan      html  css  js  c++  java
  • UVA 10066 The Twin Towers(LCS)

    Problem B

    The Twin Towers

    Input: standard input

    Output: standard output

    Once upon a time, in an ancient Empire, there were two towers of dissimilar shapes in two different cities. The towers were built by putting circular tiles one upon another. Each of the tiles was of the same height and had integral radius. It is no wonder that though the two towers were of dissimilar shape, they had many tiles in common.

    However, more than thousand years after they were built, the Emperor ordered his architects to remove some of the tiles from the two towers so that they have exactly the same shape and size, and at the same time remain as high as possible. The order of the tiles in the new towers must remain the same as they were in the original towers. The Emperor thought that, in this way the two towers might be able to stand as the symbol of harmony and equality between the two cities. He decided to name them the Twin Towers.

    Now, about two thousand years later, you are challenged with an even simpler problem: given the descriptions of two dissimilar towers you are asked only to find out the number of tiles in the highest twin towers that can be built from them.

    Input

    The input file consists of several data blocks. Each data block describes a pair of towers.

    The first line of a data block contains two integers N1 and N2 (1 <= N1, N2 <= 100) indicating the number of tiles respectively in the two towers. The next line contains N1 positive integers giving the radii of the tiles (from top to bottom) in the first tower. Then follows another line containing N2 integers giving the radii of the tiles (from top to bottom) in the second tower.

    The input file terminates with two zeros for N1 and N2.

    Output

    For each pair of towers in the input first output the twin tower number followed by the number of tiles (in one tower) in the highest possible twin towers that can be built from them. Print a blank line after the output of each data set.

     

    Sample Input

    7 6
    20 15 10 15 25 20 15
    15 25 10 20 15 20
    8 9
    10 20 20 10 20 10 20 10
    20 10 20 10 10 20 10 10 20
    0 0

     

    Sample Output

    Twin Towers #1
    Number of Tiles : 4

    Twin Towers #2
    Number of Tiles : 6

    题目大意:给定构成两座塔瓦片,从中挑选出一些瓦片留下,使得两座塔有相同的高度和结构,成为具有最多数量瓦片的双胞胎塔。

    动态规划LCS

     1 # include<cstdio>
     2 # include<cstring>
     3 # include<iostream>
     4 using namespace std;
     5 int N1,N2;
     6 int s1[105],s2[105];
     7 int dp[105][105];
     8 int main()
     9 {
    10     int cas=1;
    11     int i,j;
    12     while(scanf("%d%d",&N1,&N2)&&N1&&N2)
    13     {
    14         for(i=1; i<=N1; i++)
    15             scanf("%d",&s1[i]);
    16         for(i=1; i<=N2; i++)
    17             scanf("%d",&s2[i]);
    18         printf("Twin Towers #%d
    ",cas++);
    19         
    20         memset(dp,0,sizeof(dp));    //边界条件
    21         int ans=0;
    22         for(i=1; i<=N1; i++)    //状态转移
    23             for(j=1; j<=N2; j++)
    24             {
    25                 if(s1[i]==s2[j])
    26                     dp[i][j] = dp[i-1][j-1]+1;
    27                 else
    28                     dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
    29                 if(ans<dp[i][j])
    30                     ans = dp[i][j];
    31             }
    32         printf("Number of Tiles : %d
    
    ",ans);
    33     }
    34     return 0;
    35 }
  • 相关阅读:
    读书-《智能时代》-机器智能正在革我们的命
    判断Http服务器是否支持支持断点续传
    最全Html标签Meta介绍
    用PHP整理照片和视频文件
    读书-《癌症.真相:医生也在读》-我所认识的癌症
    scrapy-redis组件配置用例
    Scrapy+seleninu抓取内容同时下载图片几个问题
    无界浏览器Chorme命令行开关
    Scrapy Crawl 运行出错 AttributeError: 'xxxSpider' object has no attribute '_rules' 的问题解决
    福利,OpenCV最新中文版官方教程来了
  • 原文地址:https://www.cnblogs.com/acm-bingzi/p/3183225.html
Copyright © 2011-2022 走看看