算法分析与实践-作业9-LCS算法

1、问题

2、解析

举例：
X=<B,D,C,A,B,A>
Y=<A,B,C,B,D,A,B>

3、设计

4、分析

T(n)=O(mn)

5、源码

#include <stdio.h>
char X[130], Y[130];
int C[130][130] = {0}, B[130][130] = {0};
int m, n;
void f(int B[][130],int i,int j) {
	if (i == 0 || j == 0) {
		return;
	}
	if (B[i][j] == 2) {
		f(B, i-1, j-1);
		printf("%c ", X[i]);
	}
	else if (B[i][j] == 1) {
		f(B, i-1, j);
	}
	else {
		f(B, i, j-1);
	}
}
void LCS(int m,int n,char X[],char Y[],int C[][130],int B[][130]) {
	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] = 2;
			}
			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] = 0;
				}
			}
		}
	}
	f(B, m, n);
}
int main(){
	scanf("%d %d", &m, &n);
	for (int i = 1; i <= m; i++){
		scanf(" %c", &X[i]);
	}
	for (int i = 1; i <= n; i++){
		scanf(" %c", &Y[i]);
	}
	LCS(m,n,X,Y,C,B);
}
/*
6 7
B D C A B A
A B C B D A B
*/

附测试结果：