简单的二维一边推
Code:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
using namespace std;
char st1[1100],st2[1100];
int f[1100][1100];
void Solve()
{
memset(f,0,sizeof(f));
for(int i=1;i<=strlen(st1+1);i++)
{
for(int j=1;j<=strlen(st2+1);j++)
{
if(st1[i]==st2[j])
f[i][j]=max(f[i][j],f[i-1][j-1]+1);
f[i][j]=max(max(f[i-1][j],f[i][j-1]),f[i][j]);
}
}
}
void Output()
{
printf("%d\n",f[strlen(st1+1)][strlen(st2+1)]);
}
int main()
{
while(scanf("%s%s",st1+1,st2+1)!=EOF)
{
Solve();
Output();
memset(st1,'\0',sizeof(st1));
memset(st2,'\0',sizeof(st2));
}
return 0;
}