pku1458.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <string.h>

char s1[500], s2[500];

int max(int a, int b)
{
	return (a > b) ? a : b;	
}

void check()
{
	int p[501][501] = {0};
	int i, j, l1, l2;
	l1 = strlen(s1);
	l2 = strlen(s2);

	for (i =0; i <= l1; i++)
	{
		p[i][0] = 0;	
	}
	
	for (j =0; j <= l2; j++)
	{
		p[0][j] = 0;	
	}
	
	for (i = 1; i <= l1; i++)
	{
		for (j = 1; j <= l2; j++)
		{
			if (s1[i-1] == s2[j-1])
			{
				p[i][j] = p[i-1][j-1] + 1;
			}
			else
			{
				p[i][j] = max(p[i][j-1], p[i-1][j]);	
			}	
		}	
	}
	printf("%d\n",p[l1][l2]);
}

int main()
{
	while(scanf("%s%s", s1, s2) != -1)
	{
		check();	
	}
	return 0;
}