算法导论之最长公共子序列

算法导论之最长公共子序列的c++实现，算法参考《算法导论》第二版：

#include<iostream>
using namespace std;
typedef struct Elem
{
int **c;
char **b;
}Elem;


Elem lcs_length(char x[], char y[],int m,int n);//注意零号位置不用
int print_lcs(char **b, char *x, int i,int j);


int main()
{
int m, n;
cout<<"请输入x的长度m = ";
cin>>m;
cout<<"请输入y的长度n = ";
cin>>n;
char *x = new char[m+1];
char *y = new char[n+1];
x[0] = '#';
y[0] = '#';
for(int i = 1; i <= m; ++i)
{
cout<<"请输入x["<<i<<"]= "<<endl;
cin>>x[i];
}
for(int i = 1; i <= n; ++i)
{
cout<<"请输入y["<<i<<"]= "<<endl;
cin>>y[i];
}

//char x[] = {'#','a','b','c','b','d','a','b'};
//char y[] = {'#','b','d','c','a','b','a'};
//int m = sizeof(x)/sizeof(char)-1;
//int n = sizeof(y)/sizeof(char)-1;
Elem Ey;
Ey = lcs_length(x,y,m,n);
print_lcs(Ey.b,x,m,n);
system("pause");
return 0;
}
Elem lcs_length(char x[], char y[],int m,int n)
{
cout<<'m'<<m<<'n'<<n;
int **c = new int*[m+1];
char **b = new char*[m+1];
for(int i = 0; i < m+1; ++ i)
{
c[i] = new int[n+1];
b[i] = new char[n+1];
}
for(int i = 1; i <= m; ++i)
c[i][0] = 0;
for(int i = 0; i<= n; ++i)
c[0][i] = 0;
for(int i = 1; i <= m; ++i)
for(int j = 1; j <= n; ++j)
{
if(x[i] == y[j])
{
c[i][j] = c[i-1][j-1] + 1;
b[i][j] = 'S';
}
else if(c[i-1][j] >= c[i][j-1])
{
c[i][j] = c[i-1][j];
b[i][j] = 'U';
}
else
{
c[i][j] = c[i][j-1];
b[i][j] = 'L';
}
} 
Elem Y;
Y.c = c;
Y.b = b;
return Y;
}
int print_lcs(char **b, char *x, int i,int j)
{
if( i == 0 || j == 0)
return 0;
if(b[i][j] == 'S')
{
print_lcs(b,x,i-1,j-1);
cout<<x[i]<<' ';
}
else if(b[i][j] == 'U')
print_lcs(b,x,i-1,j);
else
print_lcs(b,x,i,j-1);
return 0;
}