LCS最长公共子序列

模板

注意:最长公共子串(Longest Common Substirng)和最长公共子序列(Longest Common Subsequence,简称LCS)的区别为是最长公共子串的串是一个连续的部分,而最长公共子序列则是从不改变序列的顺序,而从序列中去掉任意的元素而获得新的序列;通俗的说就是子串中字符的位置必须是连续的而子序列则可以不必连续.

//x字符串长度为m y字符串长度为n
void LCSLength(char x[], char y[],int m，int n)
{  
       /* 计算最长公共子序列的长度 */
       int Lcs[m][n],i，j;
       for (i = 1; i <= m; i++)
       {
          for (j = 1; j <= n; j++) 
          {
             if (x[i]==y[j]) 
                  Lcs[i][j]=L[i-1][j-1]+1;
             else if (Lcs[i-1][j]>= Lcs[i][j-1])
                  Lcs[i][j]= Lcs[i-1][j]; 
             else 
                  Lcs[i][j]= Lcs[i][j-1];
          }
       } 
       return Lcs[m][n];
}

例题

蓝桥杯国赛蓝肽子序列

#include <iostream>
#include <cstring>
using namespace std;

string s1, s2;
char fs1[1000][1000], fs2[1000][1000];
int lcs[1005][1005];
int len1 = 0;
int t1 = 0;
int len2 = 0;
int t2 = 0;

void LCS()
{
    for (int i = 1; i <= len1; i++)
        for (int j = 1; j <= len2; j++)
        {
            if (strcmp(fs1[i], fs2[j]) == 0)
            {
                lcs[i][j] = lcs[i - 1][j - 1] + 1;
                //cout << "ok" << endl;
            }
            else
            {
                lcs[i][j] = max(lcs[i][j - 1], lcs[i - 1][j]);
            }
        }
}

int main()
{
    cin >> s1 >> s2;
    for (int i = 0; i < s1.size(); i++)
    {
        if (s1[i] >= 'A' && s1[i] <= 'Z')
        {
            len1++;
            t1 = 0;
        }
        fs1[len1][t1] = s1[i];
        t1++;
        
    }
    
    for (int i = 0; i < s2.size(); i++)
    {
        if (s2[i] >= 'A' && s2[i] <= 'Z')
        {
            len2++;
            t2 = 0;
        }
        fs2[len2][t2] = s2[i];
        t2++;
    }

    /*for (int i = 1; i <= len2; i++)
        cout << fs2[i] << "\n";*/
    LCS();
    cout << lcs[len1][len2];
    return 0;
}

原文

https://blog.csdn.net/Eastmount/article/details/14162173