#include <string>
#include <iostream>
using namespace std;
int a[100][100];
int getSubStringLen(string query, string text){
int max = 0;
int m = query.length(), n = text.length();
for(int i = 0; i < m; ++i){
for(int j = 0; j < n; ++j){
if(query[i] == text[j]){
if(i == 0 || j == 0)
a[i][j] = 1;
else
a[i][j] = a[i-1][j-1] + 1;
max = max > a[i][j] ? max : a[i][j];
}
}
}
return max;
}
int main(){
string query, text;
cin >> query >> text;
cout << getSubStringLen(query, text);
return 0;
}
最长公共连续串问题
最新推荐文章于 2024-02-23 18:04:38 发布