``/*
动态规划经典示例-最长公共子串和最长公共子序列
举例:
str1=“GHJ8675FDS” str2 = “J86FDHL”
最长公共子串是:J86
最长公共子序列是:J86FD
最长公共子串:
dp[i][j] – 表示子串str1[0…i]和子串str[0…j]的最长公共子串
当str1[i] == str2[j]时,dp[i][j] = dp[i-1][j-1] + 1;
否则,dp[i][j] = 0;
最长公共子序列:
dp[i][j] – 表示子串str1[0…i]和子串str[0…j]的最长公共子序列
当str1[i] == str2[j]时,dp[i][j] = dp[i-1][j-1] + 1;
否则,dp[i][j] = Max(dp[i-1][j], dp[i][j-1]);
*/
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#define Max(a,b) (a>b?a:b)
using namespace std;
//最长公共子串
int getCommonStrLength1(string str1, string str2)
{
int len1 = str1.size();
int len2 = str2.size();
int max = 0;
vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1, 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] > max)//最大值记录
{
max = dp[i][j];
}
}
}
dp.clear();
return max;
}
// 最长公共子序列
int getCommonStrLength2(string str1, string str2)
{
int len1 = str1.size();
int len2 = str2.size();
int max = 0;
vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1, 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] = Max(dp[i-1][j], dp[i][j-1]); /
}
if(dp[i][j] > max)//最大值记录
{
max = dp[i][j];
}
}
}
dp.clear();
return max;
}
int main()
{
string str1, str2;
while(cin>>str1>>str2)
{
cout << getCommonStrLength1(str1, str2) << endl;
cout << getCommonStrLength2(str1, str2) << endl;
}
return 0;
}