POJ Common Subsequence 1458 （最长公共子序列）动态规划算法

问题描述

原题链接

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, …, xm > another sequence Z = < z1, z2, …, zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, …, ik > of indices of X such that for all j = 1,2,…,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.

算法思想

动态规划算法。设有两个字符串S1和S2，设i,j分别表示S1和S2的前i个、前j个字符，令C[i][j]=x表示S1字符串的前i个字符和S2字符串的前j个字符的最长公共子序列长度为x。当i=0或j=0时，令C[i][j]=0；当xi=yj且i>0、j>0时，C[i][j]=C[i-1][j-1]+1;当xi!=yj且i>0、j>0时,令C[i][j]=max{C[i][j-1],C[i-1][j]}。

代码

#include<iostream>
#include<String>
using namespace std;
int main()
{
	string a, b;
	cin >> a >> b;
	int len1 = a.length();
	int len2 = b.length();
	int c[100][100] = { 0 };
	for (int i = 1; i <= len1; i++)
	{
		for (int j = 1; j <= len2; j++)
		{
			if (a[i - 1] == b[j - 1])
			{
				c[i][j] = c[i - 1][j - 1] + 1;
			}
			else
			{
				int m = c[i - 1][j] - c[i][j - 1];
				if (m > 0)
					c[i][j] = c[i - 1][j];
				if (m <= 0)
					c[i][j] = c[i][j - 1];
			}
		}
	}
	int number=c[len1][len2];
	cout << number;
	return 0;
}