题解 | 公共子串计算

s = input()
t = input()

dp = [[0] * (len(s) + 1) for _ in range(len(t) + 1)]
max_value = 0
for i in range(1, len(t)+1):
    for j in range(1, len(s)+1):
        dp[i][j] = dp[i-1][j-1]+1 if s[j-1] == t[i-1] else 0
        if max_value < dp[i][j]:
            max_value = dp[i][j]
print(max_value)