最长公共子序列LCS

#include<iostream>#include<cstring>#include<string>#define MAX 100int dp[MAX][MAX];using namespace std;void solve(string a,string b){    memset(dp,0,sizeof(dp));    for(int i=0;i<a.size();i++)    {        for(int j=0;j<b.size();j++)        {            if(a[i]==b[j])                dp[i+1][j+1]=dp[i][j]+1;            else                dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]);        }    }    cout<<dp[a.size()][b.size()]<<endl;}int main(){    string a,b;    while(cin>>a>>b)        solve(a,b);}