杭电 1503 Advanced Fruits

时间：2016-08-13 08:51:14 阅读：184 评论：0 收藏：0 [点我收藏+]

标签：

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

题目意思就是找到一个最短序列，使a,b字符串都是这个序列里的，且前后顺序不变（不一定连续）

代码我也是不太懂，就不解释了

 1 #include<cstdio>
 2 #include<cstring>
 3 int flag[110][110],dp[110][110],lena,lenb;
 4 char a[110],b[110];
 5 void out(int x,int y)
 6 {
 7     if(x==0&&y==0)
 8     {
 9         return ;
10     }
11     else
12     {
13         if(flag[x][y] == 0)
14         {
15             out(x-1,y-1);
16             printf("%c",a[x-1]);
17         }
18         if(flag[x][y] == 1)
19         {
20             out(x-1,y);
21             printf("%c",a[x-1]);
22         }
23         if(flag[x][y] == -1)
24         {
25             out(x,y-1);        
26             printf("%c",b[y-1]);
27         }
28     }
29 }
30 int main()
31 {
32     while(scanf("%s%s",&a,&b)!=EOF)
33     {    
34         lena=strlen(a);
35         lenb=strlen(b);
36     
37         int i,j;
38         memset(dp,0,sizeof(dp));
39         for(i = 0 ; i < lena ; i++)
40             flag[i][0]=1;
41         for(i = 0 ; i < lenb ; i++)
42             flag[0][i]=-1;
43         for(i = 1 ; i <= lena ; i++)
44         {
45             for(j = 1 ; j <= lenb ; j++)
46             {
47                 if(a[i-1] == b[j-1])
48                 {
49                     dp[i][j]=dp[i-1][j-1]+1;
50                     flag[i][j]=0;
51                 }
52                     
53                 else
54                 {
55                     if(dp[i-1][j] >= dp[i][j-1])
56                     {
57                         dp[i][j]=dp[i-1][j];
58                         flag[i][j]=1;
59                     }
60                     else
61                     {
62                         dp[i][j]=dp[i][j-1];
63                         flag[i][j]=-1;
64                     }
65                 }
66             }
67         }
68         out(lena,lenb);
69         printf("\n");
70     }
71 }

杭电 1503 Advanced Fruits

标签：

原文地址：http://www.cnblogs.com/yexiaozi/p/5767186.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行