经典LCS问题
状态转移方程
dp[i][j] = dp[i-1][j-1]+1; a[i]==b[j]
dp[i][j] = max(dp[i-1][j],dp[i][j-1]) ;a[i]!=b[j]
#include<iostream>
#include<cstring>
using namespace std;
string a,b;
const int N = 1010;
int dp[N][N];
int main()
{
while(cin>>a>>b)
{
memset(dp,0,sizeof dp);
for(int i=1;i<=a.size();i++)
{
for(int j=1;j<=b.size();j++)
{
if(a[i-1]==b[j-1]) dp[i][j] = dp[i-1][j-1]+1;
else dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
}
}
cout<<dp[a.size()][b.size()]<<endl;
}
}