HDU 1503 Advanced Fruits

//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

char s1[205], s2[205];
int path[205][205], dp[205][205];

void Print(int i, int j)
{
if(i == 0 && j == 0)    return;
if(i == 0 && j != 0)
{
Print(i, j-1);
printf("%c", s2[j-1]);
}
else if(i != 0 && j == 0)
{
Print(i-1, j);
printf("%c", s1[i-1]);
}
else if(path[i][j] == 0)
{
Print(i-1, j-1);
printf("%c", s1[i-1]);
}
else if(path[i][j] == 1)
{
Print(i-1, j);
printf("%c", s1[i-1]);
}
else
{
Print(i, j-1);
printf("%c", s2[j-1]);
}
}

int main(void)
{
#ifdef LOCAL
freopen("1503in.txt", "r", stdin);
#endif

while(cin >> s1 >> s2)
{
int len1, len2;
len1 = strlen(s1);
len2 = strlen(s2);
int i, j;
for(i = 1; i <= len1; ++i)
for(j = 1; j <= len2; ++j)
{
if(s1[i-1] == s2[j-1])
{
dp[i][j] = dp[i-1][j-1] + 1;
path[i][j] = 0;
}
else if(dp[i-1][j] > dp[i][j-1])
{//从上边来
dp[i][j] = dp[i-1][j];
path[i][j] = 1;
}
else
{//从左边来
dp[i][j] = dp[i][j-1];
path[i][j] = 2;
}
}

Print(len1, len2);
printf("\n");
}
return 0;
}