算法分析与设计（实验九LCS）

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cstdlib>
using namespace std;
int lcs_len(string s1, string s2){
    int len1 = s1.size(), len2 = s2.size();
    if (len1==0 || len2==0)return 0;
    int dp[10][10];
    memset(dp,0,sizeof(dp));
    for (int i = 1; i <=len1; i++){
        for (int j = 1; j <=len2; j++){
            if (s1[i - 1] == s2[j - 1]){
                dp[i][j] = dp[i - 1][j - 1] + 1;
            }
            else{
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }

    }
    return dp[len1][len2];
}
int main(){
    string s1, s2;
    while (cin >> s1 >> s2){

        cout << s1 << "  " << s2 << "的最长公共子串长度为" << lcs(s1, s2) << endl;
    }

    return 0;
}