poj2250

#include <cstdio>
#include <iostream>
#include <map>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
#define  LL long long
#define mini 1e-5
#define FOR(i,n) for(int i=0;i<n;i++)
#define FOR2(i,n) for(int i=1;i<=n;i++)
string a[101], b[101];
int dp[101][101];
int si[101][101];
int ca = 1, cb = 1;
void print(int aa,int bb ){
static int cnt2 = 0, maxi = 0;;
maxi = max(cnt2, maxi);
if (aa == 0 || bb == 0){
return;
}
if (si[aa][bb] == 0){
cnt2++;
print(aa - 1, bb - 1);
cnt2--;
if (cnt2 != 0)
cout << a[aa] << " ";
else
cout << a[aa] << endl;
}
else if (si[aa][bb] == 1){
print(aa - 1, bb);
}
else{
print(aa, bb - 1);
}
}
int main(){
string t;
int c = 0;
while (cin >> t&& t != "#"){
ca = 1; cb = 1;
a[ca++] = t;
while (cin >> t  && t != "#"){
a[ca++] = t;
}
ca--;
while (cin >> t  && t != "#"){
b[cb++] = t;
}
cb--;
memset(dp, 0, sizeof(dp));
FOR2(i, ca){
FOR2(j, cb){
if (a[i] == b[j]){
dp[i][j] = dp[i - 1][j - 1] + 1;
si[i][j] = 0;
}
else if (dp[i - 1][j] >= dp[i][j - 1]){
dp[i][j] = dp[i - 1][j];
si[i][j] = 1;
}
else {
dp[i][j] = dp[i][j - 1];
si[i][j] = 2;
}
}
}
print(ca, cb);
}
//system("pause");
return 0;
}