NYOJ 36 LCS 動態規劃入門

#include <stdio.h>
#include <string.h>
int max( int a, int b )
{
	return a > b ? a : b;
}
int d[1001][1001];
char s1[2000];
char s2[2000];
int main()
{
	int la, lb, N;
	scanf( "%d", &N );
	while( N-- )
	{
		memset( d, 0, sizeof(d) );
		scanf( "%s", s1 ); la = strlen(s1);
		scanf( "%s", s2 ); lb = strlen(s2);
		for( int i = 1; i <= la; i++ )
			for( int j = 1; j <= lb; j++ )
			{
				if( s1[i-1] == s2[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[la][lb] );
	}
	return 0; 
}