题解 | #Coincidence#

// 最长公共子序列
#include<bits/stdc++.h>
using namespace std;
const int maxn=101;
string str1,str2;
int main(){
    while (cin>>str1>>str2)
    {
        int m=str1.size();int n=str2.size();
        int dp[maxn][maxn];
        memset(dp, 0, sizeof(dp));
        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {

                if(str1[i-1]==str2[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[m][n]<<endl;
    }
    
}