zstu 1090 Common Subsequence

[code]#include<stdio.h>
#include<string.h>
#define maxn 1010
char a[maxn];
char b[maxn];
int dp[maxn][maxn];
int max(int g,int h)
{
    return g>h?g:h;
}
int main()
{
    while(scanf("%s%s",a,b)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        int a1=strlen(a);
        int b1=strlen(b);
        for(int i=1;i<=a1;i++)
        {
            for(int j=1;j<=b1;j++)
            {
                if(a[i-1]==b[j-1])
                {
                    dp[i][j]=dp[i-1][j-1]+1;
                }
                else
                {
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        printf("%d\n",dp[a1][b1]);
    }
    return 0;
}