题解 | #公共子串计算#

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string str1, str2;
    cin >> str1 >> str2;
    int len1 = str1.length(), len2 = str2.length();
    int dp[len1+1][len2+1];
    int maxlen = -1;
    for(int i=0;i<len1;i++) dp[i][0] = 0;
    for(int i=0;i<len2;i++) dp[0][i] = 0;
    for(int i=1;i<=len1;i++)
    {
        for(int j=1;j<=len2;j++)
        {
            if(str1[i-1] == str2[j-1])
                dp[i][j] = dp[i-1][j-1] + 1;
            else 
                dp[i][j] = 0;
            if(dp[i][j] > maxlen)
                maxlen = dp[i][j];
        }
    }
    cout << maxlen;
    return 0;
}