POJ1458 Common Subsequence

微微发亮的传送门

最长公共子序列长度，找到了原来程序的一个隐藏的bug

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char x[1111], y[1111];
int dp[1111][1111];
int main(){
	while(~scanf("%s%s", x, y)){
		int lx = strlen(x);
		int ly = strlen(y);
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= lx; i++)
			for (int j = 1; j <= ly; j++)
				if (x[i - 1] == y[j - 1]) dp[i][j] = max(dp[i - 1][j - 1] + 1, max(dp[i - 1][j], dp[i][j - 1]));
				else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
		printf("%d\n", dp[lx][ly]);
	}
	return 0;
}