POJ最长公共子序列1458

#include"iostream"
#include"cstdio"
#include"string"
#include"algorithm"
using namespace std;
int main()
{
	//freopen("a.txt","r",stdin);
    char a[1000];
	char b[1000];
	while(cin>>a>>b)
	{
		int i,j;
		int d[1000][1000]={0};
		int maxn=0;
		for(i=1;i<=strlen(a);i++)
		{
			for(j=1;j<=strlen(b);j++)
			{
				if(a[i-1]==b[j-1])
					d[i][j]=d[i-1][j-1]+1;
				else
					d[i][j]=max(d[i-1][j],d[i][j-1]);
			if(d[i][j]>maxn)
				maxn=d[i][j];
			}
		}
		cout<<maxn<<endl;
	}
	return 0;
}