hdu 1503 Advanced Fruits (LCS)
题意:LCS,注意需要交叉打印两个字符。
比如:abbc gbbh 结果是agbbch,意思是从左到右删除一些字符总能找出原来的两个字符串。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <stack>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <numeric>
using namespace std;
#define LL long long
#define M 102
#define DEBUG puts("It's here!")
#define INF 1<<29
#define CLS(x,v) memset(x,v,sizeof(x))
#define FU(i,a,n) for(int i=a;i<(n);++i)
#define FD(i,a,n) for(int i=n;i>a;++i)
#define filer freopen("C:\\Users\\sq\\Desktop\\1.in","r",stdin)
#define filew freopen("C:\\Users\\sq\\Desktop\\2.out","w",stdout)
char s[M],t[M];
struct position
{
int x,y;
} cnt[M];
int dp[M][M];
int step[M][M];
int n,m,len,k;
void getLCS()
{
int i=n,j=m;
while(i>0&&j>0)
{
if(step[i][j]==0)
{
cnt[--k].x=i-1;
cnt[k].y=j-1;
i--;j--;
}
else if (step[i][j]==-1)j--;
else i--;
}
}
void LCS()
{
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{
if(s[i-1]==t[j-1])
{
dp[i][j]=dp[i-1][j-1]+1;
step[i][j]=0;
}
else if(dp[i-1][j]>=dp[i][j-1])
{
dp[i][j]=dp[i-1][j];
step[i][j]=1;
}
else
{
dp[i][j]=dp[i][j-1];
step[i][j]=-1;
}
}
len=k=dp[n][m];
getLCS();
}
void show()
{
if(len==0)
{
printf("%s%s\n",s,t);
return;
}
int i=0,j=0,k=0;
cnt[len].x=n;
cnt[len].y=m;
while(i<n||j<m)
{
while(i<cnt[k].x)putchar(s[i++]);
while(j<cnt[k].y)putchar(t[j++]);
i++;
j++;
if(k<len)putchar(s[cnt[k++].x]);
}
putchar('\n');
}
int main()
{
while(~scanf("%s%s",&s,&t))
{
n=strlen(s);
m=strlen(t);
LCS();
show();
}
return 0;
}
/*
abbc gbbk
*/