一本通 1265：【例9.9】最长公共子序列

最长公共子序列

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
//Mystery_Sky
//
#define M 1000
string s1, s2;
int len1, len2;
int f[M][M], ans;
int main() {
    cin >> s1;
    cin >> s2;
    len1 = s1.size(), len2 = s2.size();
    for(int i = 1; i <= len1; i++)
        for(int j = 1; j <= len2; j++) {
            if(s1[i-1] == s2[j-1]) 
                f[i][j] = max(f[i][j], f[i-1][j-1] + 1);
            else f[i][j] = max(f[i][j-1], f[i-1][j]);
        }
    printf("%d\n", f[len1][len2]);
    return 0;
}

转载于:https://www.cnblogs.com/Benjamin-cpp/p/10840952.html