算法分析与设计——动态规划最长公共子序列C++

#include <iostream>
#include <string.h>
using namespace std;
#define MAXLEN 100
void LCSlength(char *x,char *y,int m,int n,int c[][MAXLEN],int b[][MAXLEN])
{
    
    
	int i,j;
	for(int i=0;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-1]==y[j-1]){
    
    
				c[i][j]=c[i-1][j-1]+1;
				b[i][j]=0;
			}
			else if(c[i-1][j]>=c[i][j-1]){
    
    
				c[i][j]=c[i-1][j];
				b[i][j]=1;
				
			}
			else{
    
    
				c[i][j]=c[i][j-1];
				b[i][j]=2;
			}
		}
	}
	
}

void Traceback(char *x,int i,int j,int b[][MAXLEN])
{
    
    
	if(i==0 ||j==0)
		return ;
	if(b[i][j]==0){
    
    
		Traceback(x,i-1,j-1,b);
		cout<<x[i-1];
	}
	
	else if(b[i][j]==1){
    
    
		Traceback(x,i-1,j,b);
	}
	else{
    
    
		Traceback(x,i,j-1,b);
	}
}
int main()
{
    
    
	char x[MAXLEN]={
    
    "ABCBDAB"};
	char y[MAXLEN]={
    
    "BDCABA"};
	int b[MAXLEN][MAXLEN];
	int c[MAXLEN][MAXLEN];
	
	int m=strlen(x);
	int n=strlen(y);
	LCSlength(x,y,m,n,c,b);
	Traceback(x,m,n,b);
	
	
	return 0;
    
}