hdu 1159 Common Subsequence

#include<bits/stdc++.h>
using namespace std;
#define MXM 1010
string str1,str2;
int dp[MXM][MXM];
int main ()
{
	int i,j;
	while(cin>>str1>>str2)
	{
		memset(dp,0,sizeof dp);
		for(i = 1;i<=str1.length();i++)
		{
			for(j = 1;j<=str2.length();j++)
			{
				if(str1[i-1]==str2[j-1]) dp[i][j] = dp[i-1][j-1]+1;
				else
				dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
			}
		}
		printf("%d\n",dp[str1.length()][str2.length()]);
	}
	return 0;
} 

添加链接描述