poj1458

#include<iostream>
#include<string>
using namespace std;
string ss1,ss2;
int d[10000][10000];
int main(){
    while(cin>>ss1>>ss2){
        int n=ss1.length();
        int m=ss2.length();
        for(int i=0;i<=n;i++){d[i][0]=d[0][i];}
  
     for(int i=0;i<n;i++)
     for(int j=0;j<m;j++){
        if(ss1[i]==ss2[j]) d[i+1][j+1]=d[i][j]+1;     
        else if(d[i][j+1]>d[i+1][j])
            d[i+1][j+1]=d[i][j+1];
        else
           d[i+1][j+1]=d[i+1][j];
           }
         cout<<d[n][m]<<endl;
       }
    system("pause");
    return 0;}

 

下面是重构lcs序列的算法！！！

Algorithm lcsLength(x,y,b)
1: mx.length-1;
2: ny.length-1;
3: c[i][0]=0; c[0][i]=0;
4: for (int i = 1; i <= m; i++)
5: for (int j = 1; j <= n; j++)
6: if (x[i]==y[j])
7: c[i][j]=c[i-1][j-1]+1;
8: b[i][j]=1;
9: else if (c[i-1][j]>=c[i][j-1])
10: c[i][j]=c[i-1][j];
11: b[i][j]=2;
12: else
13: c[i][j]=c[i][j-1];
14: b[i][j]=3;
构造最长公共子序列
Algorithm lcs(int i,int j,char [] x,int [][] b)
{
if (i ==0 || j==0) return;
if (b[i][j]== 1){
lcs(i-1,j-1,x,b);
System.out.print(x[i]);
}
else if (b[i][j]== 2) lcs(i-1,j,x,b);
else lcs(i,j-1,x,b);
}