Advanced Fruits_lcs+记录

原创 2018年04月17日 21:00:57
The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn't work, but sometimes, in very rare cases, a new fruit emerges that tastes like a mixture between both of them.
A big topic of discussion inside the company is "How should the new creations be called?" A mixture between an apple and a pear could be called an apple-pear, of course, but this doesn't sound very interesting. The boss finally decides to use the shortest string that contains both names of the original fruits as sub-strings as the new name. For instance, "applear" contains "apple" and "pear" (APPLEar and apPlEAR), and there is no shorter string that has the same property.

A combination of a cranberry and a boysenberry would therefore be called a "boysecranberry" or a "craboysenberry", for example.

Your job is to write a program that computes such a shortest name for a combination of two given fruits. Your algorithm should be efficient, otherwise it is unlikely that it will execute in the alloted time for long fruit names.

Input Each line of the input contains two strings that represent the names of the fruits that should be combined. All names have a maximum length of 100 and only consist of alphabetic characters.

Input is terminated by end of file.
Output For each test case, output the shortest name of the resulting fruit on one line. If more than one shortest name is possible, any one is acceptable.
Sample Input
apple peach
ananas banana
pear peach
Sample Output
appleach
bananas
pearch
#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int N(105);
char a[N],b[N];
int pre[N][N];

void print(int i,int j){
    if(!i&&!j)return ;
    if(pre[i][j]==j+1){
        print(i-1,j-1);
        cout<<a[i];
    }else if(pre[i][j]==j){
        print(i-1,j);
        cout<<a[i];
    }else{
        print(i,j-1);
        cout<<b[j];
    }
}


int main(){
   //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(cin>>a+1>>b+1){
        int dp[N][N]={0};
        int n=strlen(a+1);
        int m=strlen(b+1);
        for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++){
            if(a[i]==b[j]){
                dp[i][j]=dp[i-1][j-1]+1;
                pre[i][j]=j+1;
            }else if(dp[i][j-1]>=dp[i-1][j]){
                dp[i][j]=dp[i][j-1];
                pre[i][j]=j-1;
            }else{
                dp[i][j]=dp[i-1][j];
                pre[i][j]=j;
            }
        }
        print(n,m);
        cout<<endl;
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ujn20161222/article/details/79980725

安装包打包工具 Advanced Installer Architect 14.3 破解+中文汉化

  • 2017年09月27日 18:06
  • 18.12MB
  • 下载

小白用advanced installer建安装包

写这篇文章的目的是因为肯定有人跟我一样很小白,对安装包的构建又好奇
  • wuxiaoyao12
  • wuxiaoyao12
  • 2015-06-12 15:15:26
  • 5814

Advanced Installer 11.0实战教程

把windows服务程序,打包成为一个安装程序,安装后可以自动启动服务;并且在桌面上建立快捷方式,用于查看日志文件及安装目录。...
  • neweastsun
  • neweastsun
  • 2015-02-11 08:02:30
  • 5538

使用 advanced installer 为 winform 做自动更新

advanced installer 是一款打包程序,基于 windows installer 并扩展了一些功能,比如安装统计,自动更新,授权验证等,本文将介绍你如果使用 advanced insta...
  • Scaperow
  • Scaperow
  • 2015-12-02 11:58:44
  • 2028

安装程序制作工具Advanced Installer破解补丁14.0-14.2 Deluxe

  • 2017年10月15日 10:16
  • 999KB
  • 下载

Advanced Installer打包

Advanced Installer是一款功能非常强大的打包工具,可以对windows程序,web程序,windwos服务等各种类型的应用程序进行打包,具有清晰的可视化操作界面,非常易上手,使用起来简...
  • zx13525079024
  • zx13525079024
  • 2016-09-29 11:08:46
  • 1541

Advanced_Installer14.3汉化破解版

  • 2017年12月08日 10:49
  • 120.87MB
  • 下载

Advanced Installer 14.3 版本的汉化 正常使用

  • 2017年10月09日 14:17
  • 17.06MB
  • 下载

安装程序制作工具Advanced Installer 14 任意版本 破解补丁 适用于14.*

  • 2017年10月15日 10:51
  • 483KB
  • 下载
收藏助手
不良信息举报
您举报文章:Advanced Fruits_lcs+记录
举报原因:
原因补充:

(最多只允许输入30个字)