HDOJ_1159 Common Subsequence 解题报告

 Problem Description

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y. 
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line. 

 

 

Sample Input

  
  

   
   abcfbc abfcab programming contest  abcd mnp
  
  

 

 

Sample Output

  
  

   
   4 2 0
  
  

 

 

解题思路： 也是利用到动态规划，只是这个比较复杂了点，要用到二维的数组，过程比较难想象，把那个数组里的数据都打印出来，可以比较清晰地看出那个过程。

代码如下：

Code:

1. #include <iostream>  
2. using namespace std;  
3. const int Max(1000);  
4. int max(int a,int b)  
5. {  
6.     return a>b?a:b;  
7. }  
8. int data[Max][Max];  
9. int main ()  
10. {  
11.     char s1[Max],s2[Max];  
12.     while (cin>>s1>>s2)  
13.     {  
14.         int length1=strlen(s1);  
15.         int length2=strlen(s2);  
16.         int temp=max(length1,length2);  
17.         for (int i=0;i<temp;i++)  
18.         {  
19.             data[0][i]=0;  
20.             data[i][0]=0;  
21.         }   
22.         for (i=1;i<=length1;i++)  
23.         {  
24.             for (int j=1;j<=length2;j++)  
25.             {  
26.                 //状态转移方程  
27.                 if (s1[i-1]==s2[j-1])  
28.                     data[i][j]=data[i-1][j-1]+1;  
29.                 else data[i][j]=max(data[i][j-1],data[i-1][j]);  
30.             }  
31.         }  
32.         for(i=0;i<=temp;i++)  
33.         {  
34.             for(int j=0;j<=temp;j++)  
35.                 printf("%d   ",data[i][j]);  
36.             printf("/n");  
37.         }  
38.         cout<<data[length1][length2]<<endl;  
39.     }  
40.     return 0;  
41. }