最长公共子序列

#include<cstdio>
#include<cstring>

int a[510][510];
char m[510],z[510];

int main()
{
    int lm,lz,im,iz,i,t;
    while(gets(m+1) != NULL)
    {
        gets(z+1);
        lm = strlen(m+1);
        lz = strlen(z+1);
        lm++;
        lz++;
        if(lm > lz) t = lm;
        else t = lz;
        for(i = 0;i < t; i++)
            a[i][0] = a[0][i] = 0;
        for(iz = 1;iz < lz; iz++)
            for(im = 1;im < lm; im++)
            {
                if(m[im] == z[iz])
                {
                    a[im][iz] = a[im-1][iz-1] +1;
                }
                else
                {
                    if(a[im][iz-1] > a[im-1][iz])
                        a[im][iz] = a[im][iz-1];
                    else a[im][iz] = a[im-1][iz];
                }
            }
        printf("%d\n",a[lm-1][lz-1]);
    }
    return 0;
}

这篇文章讲的很详细

http://blog.csdn.net/yysdsyl/article/details/4226630