hdu1159 另附：http://acm.nyist.net/JudgeOnline/problem.php?pid=36（最长公共子序列）

题目链接：

http://acm.nyist.net/JudgeOnline/problem.php?pid=36

http://acm.hdu.edu.cn/showproblem.php?pid=1159

源代码：

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>

using namespace std;

#define N 500

char a[N];
char b[N];
int s[N][N];
int LCSlength(char *a,char *b);

int main()
{
while(scanf("%s%s",a,b)!=EOF)
{
int max=LCSlength(a,b);
printf("%d\n",max);
}
return 0;
}
int LCSlength(char *a,char *b)
{
int m=strlen(a);
int n=strlen(b);
int i,j;
for(i=0;i<N;i++)
{
s[i][0]=0;
s[0][i]=0;
}
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(a[i-1]==b[j-1])s[i][j]=s[i-1][j-1]+1;
else if(s[i-1][j]>s[i][j-1])s[i][j]=s[i-1][j];
else s[i][j]=s[i][j-1];
}
return s[m][n];
}