AcWing 3692. 最长连续公共子序列
原题链接
简单
作者:
autumn_0
,
2024-03-03 22:15:19
,
所有人可见
,
阅读 24
#include <iostream>
using namespace std;
const int N = 110;
string s1, s2;
char res[N];
int ans;
int main()
{
cin >> s1 >> s2;
for(int i = 0; i < s1.size(); i ++ )
for(int j = 0; j < s2.size(); j ++ )
{
int x = i, y = j;
int len = 0;
while(s1[i] == s2[j] && i < s1.size() && j < s2.size()) i ++ ,j ++, len ++ ;
if(len >= ans)
{
ans = len;
for(int k = 0, r = x; k < len; k ++ , r ++ )
res[k] = s1[r];
}
i = x, j = y;
}
cout << ans << endl;
for(int i = 0; i < ans; i ++ ) printf("%c", res[i]);
puts("");
return 0;
}