HDOJ1159

最长公共子序列

#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
#define MAX 10000
char x[MAX];
char y[MAX];
int D[MAX][MAX];
int max(int x,int y);
int main(int argc, char *argv[]) {
	while(cin>>x>>y)
	{
		int n = strlen(x);
		int m = strlen(y);
		for(int a=0; a <= n; a++) D[a][0] = 0;
		for(int b=0; b <= m; b++) D[0][b] = 0;
		for(int i=1; i <= n; i++)
			for(int j=1; j <= m; j++)
			{
				if(x[i-1] == y[j-1])
				D[i][j] = D[i-1][j-1] + 1;
				else
				D[i][j] = max(D[i-1][j],D[i][j-1]);
			}
		printf("%d\n",D[n][m]);
	}
	return 0;
}
int max(int x,int y)
{
	return x>y ? x : y;
}