HDU 1159 Common Subsequence

经典DP问题 话不多说上代码。。。

#include <bits/stdc++.h>
using namespace std;
string x,z;
const int N = 1000+10;
int dp[N][N];
int main()
{
	while(cin >> x >> z)
	{
		if(x == "" or z == "" ) cout << '0' << endl;
		else
		{
			memset(dp, 0, sizeof(dp));
			for(int i = 0; i < x.size(); i++)
			{
				for(int j = 0; j < z.size(); j++)
				{
					if(x[i] == z[j])
						dp[i][j] = i >= 1 and j >= 1 ? dp[i - 1][j - 1] + 1: 1;
					else dp[i][j] = max(i >= 1? dp[i - 1][j]:0, j >= 1?dp[i][j - 1]:0);
				}
			}
		}
		cout << dp[x.size() - 1][z.size() - 1] << endl;
	}
	return 0;
}