链接:http://acm.hdu.edu.cn/showproblem.php?pid=1503
最长公共子序列+路径记录
#include<cstdio>
#include<cstring>
using namespace std;
const int N=105;
int dp[N][N],pre[N][N];
char s1[N],s2[N];
void out(int i,int j)
{
if(i==0&&j==0) return;
if(pre[i][j]==1) {out(i,j-1);printf("%c",s2[j]);}
else if(pre[i][j]==3) {out(i-1,j);printf("%c",s1[i]);}
else {out(i-1,j-1);printf("%c",s1[i]);}
}
int main()
{
int i,j;
int l1,l2;
while(scanf("%s%s",s1+1,s2+1)!=EOF)
{
l1=strlen(s1+1);
l2=strlen(s2+1);
memset(dp,0,sizeof(dp));
memset(pre,0,sizeof(pre));
for(i=0;i<=l1;i++) pre[i][0]=3;
for(i=0;i<=l2;i++) pre[0][i]=1;
for(i=1;i<=l1;i++)
{
for(j=1;j<=l2;j++)
{
if(s1[i]==s2[j]) {dp[i][j]=dp[i-1][j-1]+1;pre[i][j]=2;}
else if(dp[i][j-1]>dp[i-1][j]){dp[i][j]=dp[i][j-1];pre[i][j]=1;}
else {dp[i][j]=dp[i-1][j];pre[i][j]=3;}
}
}
out(l1,l2);
printf("\n");
}
return 0;
}