uva 531 - Compromise

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <map>
#define maxn 100 + 10
#define INF 0x7fffffff
using namespace std;
char words1[maxn][50], words2[maxn][50];
int dp[maxn][maxn];
int d[maxn][maxn];
bool first;
void print(int len1, int len2)
{
    if(len1 <= 0 || len2 <= 0) return;
    if(d[len1][len2] == 0)
    {
        print(len1-1, len2-1);
        if(first)
        {
            printf("%s", words1[len1-1]);
            first = false;
        }
        else printf(" %s", words1[len1-1]);
    }
    else if(d[len1][len2] == 1)
        print(len1, len2-1);
    else print(len1-1, len2);
    return;
}
int main()
{
    int len1, len2;
    while(scanf("%s", words1[0]) != EOF)
    {
        len1 = 1;
        while(scanf("%s", words1[len1]))
        {
            if(words1[len1][0] == '#') break;
            ++len1;
        }
        len2 = 0;
        while(scanf("%s", words2[len2]))
        {
            if(words2[len2][0] == '#') break;
            ++len2;
        }
        memset(dp, 0, sizeof(dp));
        for(int i = 0; i < len1; ++i)
        {
            for(int j = 0; j < len2; ++j)
            {
                if(!strcmp(words1[i], words2[j]))
                {
                    dp[i+1][j+1] = dp[i][j] + 1;
                    d[i+1][j+1] = 0;
                }
                else if(dp[i+1][j] > dp[i][j+1])
                {
                    dp[i+1][j+1] = dp[i+1][j];
                    d[i+1][j+1] = 1;
                }
                else {
                    dp[i+1][j+1] = dp[i][j+1];
                    d[i+1][j+1] = 2;
                }
            }
        }
        first = true;
        print(len1, len2);
        puts("");
    }
    return 0;
}