poj 2264 Advanced Fruits lcs

最新推荐文章于 2022-07-17 23:31:24 发布

原创最新推荐文章于 2022-07-17 23:31:24 发布 · 593 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #poj #dp

D P一般看规律专栏收录该内容

135 篇文章

订阅专栏

本文介绍了一种用于解决两种水果基因融合后新品种命名问题的高效算法。该算法旨在找到包含两种原始水果名称的最短字符串。通过动态规划实现，确保了对于较长的水果名称也能在限定时间内得出结果。

Advanced Fruits

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2152		Accepted: 1062		Special Judge

Description

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

Source

Ulm Local 1999

把两个串给合并输出

ACcode：

#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 1005
using namespace std;
int dp[maxn][maxn];
char mystack[maxn];
char s1[maxn],s2[maxn];
int main(){
    while(scanf("%s%s",s1+1,s2+1)!=EOF){
        memset(dp,0,sizeof(dp));
        int lena=strlen(s1+1),lenb=strlen(s2+1);
        for(int i=1;i<=lena;++i)
            for(int j=1;j<=lenb;++j)
                if(s1[i]==s2[j])
                    dp[i][j]=dp[i-1][j-1]+1;
                else
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        int t=1,i=lena,j=lenb;
        while(dp[i][j]){
            if(s1[i]==s2[j]){
                mystack[t++]=s1[i];i--;j--;
            }
            else if(dp[i-1][j]>dp[i][j-1]){
                mystack[t++]=s1[i]; i--;
            }
            else{
                mystack[t++]=s2[j]; j--;
            }
        }
        while(i>=1)mystack[t++]=s1[i--];
        while(j>=1)mystack[t++]=s2[j--];
        for(i=t-1;i>0;--i)putchar(mystack[i]);
        putchar('\n');
    }
    return 0;
}
/*
apple peach
ananas banana
pear peach
cranberry boysenberry
*/