最长公共子序列 动态规划

void lcslength(int m, int n, char *x, char *y, int **c, int **b)
{
	int i, j;
	for (i = 1; i <= m; i++)                 //c[i][j]记录序列xi和yj的最长公共子序列长度
		c[i][0] = 0;
	for (j = 1; j <= n; j++)
		c[0][j] = 0;
	for (i = 1; i <= m; i++)
	{
		for (j = 1; j <= n; j++)
		{
			if (x[i] == y[j])
			{
				c[i][j] = c[i - 1][j - 1] + 1;
				b[i][j] = 1;
			}
			else if (c[i - 1][j] >= c[i][j - 1])
			{
				c[i][j] = c[i - 1][j];
				b[i][j] = 2;
			}
			else
			{
				c[i][j] = c[i][j - 1];
				b[i][j] = 3;
			}
		}
	}
}void lcs(int i, int j, char *x, int **b)
{
	if (i == 0 || j == 0)
		return;
	if (b[i][j] == 1)     //b[i][j]==1说明最长子序列是x(i-1)和y(i-1)的最长公共子序列加上最后一个相等字符
	{
		lcs(i - 1, j - 1, x, b)
			cout << x[i];
	}
	if (b[i][j] == 2)    //b[i][j]==2说明最长公共子序列为x(i-1)和y(j)的最长公共子序列
		lcs(i - 1, j, x, b);
	else lcs(i, j - 1, x, b);
}