思路:dp[i][j]的含义为str1[0..i]与str2[0..j]的最长公共子序列长度. #include<iostream> #include<string> using namespace std; const int maxn = 100; int main() { string str1,str2; ci...
