题解 | #公共子串计算#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    string s,t;
    cin>>s>>t;
    vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1, 0));
    int result = 0;
    for (int i = 1; i <= s.size(); i++){
        for (int j = 1; j <= t.size(); j++){
            if (s[i - 1] == t[j - 1])
                dp[i][j] = dp[i - 1][j - 1] + 1;
            if (dp[i][j] > result)
                result = dp[i][j];
        }
    }
    cout << result;
}
// 64 位输出请用 printf("%lld")