POJ -2250

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 150
#define M 1000
char a[N][N];
char b[N][N];
char c[M];
int dp[N][N];
int L1,L2;
void dfs(int x,int y)
{
    if(dp[x][y]==0)
    {
        return;
    }
    if(strcmp(a[x],b[y])==0)
    {
        dfs(x-1,y);
        printf("%s ",a[x]);
    }
    else
    {
        if(dp[x-1][y]>dp[x][y-1])
        {
            dfs(x-1,y);
        }
        else
        {
            dfs(x,y-1);
        }
    }
}
int main()
{
    int L1,L2;
    int len1;
    int len2;
    int i,j;
    memset(dp,0,sizeof(dp));
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    while(scanf("%s",c)!=EOF)
    {
        len1=0;
        for(;strcmp(c,"#")!=0;)
        {
            len1++;
            L1=strlen(c);
            int i;
            for(i=0; i<L1; i++)
            {
                a[len1][i]=c[i];
            }
            scanf("%s",c);
        }
        len2=0;
        scanf("%s",c);
        for(; strcmp(c,"#")!=0;)
        {
            len2++;
            L2=strlen(c);
            int i;
            for(i=0; i<L2; i++)
            {
                b[len2][i]=c[i];
            }
            scanf("%s",c);
        }
        for(i=1; i<=len1; i++)
        {
            for(j=1; j<=len2; j++)
            {
                if(strcmp(a[i],b[j])==0)
                {
                    dp[i][j]=dp[i-1][j-1]+1;
                }
                else
                {
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        dfs(len1,len2);
        memset(dp,0,sizeof(dp));
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
    }
    return 0;
}