最长公共子序列LCS与最长上升子序列LIS

子序列与子串的区别

子序列不一定连续，而子串必须是连续的。

最长公共子序列

初始状态：dp[i][0]=dp[0][j]=0;

分类讨论：若S1[i]==S2[j]，dp[i][j]=dp[i-1][j-1]+1;否则，dp[i][j]=max(dp[i-1][j],dp[i][j-1]);

例题

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.

The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.

Input

abcfbc abfcab

programming contest

abcd mnp

Output

4

2

0

Sample

Input	Output
abcfbc abfcab programming contest abcd mnp	4 2 0

题解

#include <bits/stdc++.h>
#include <algorithm>
#include <string>
typedef long long ll;
const ll maxn=5e3+7;//题目范围
const ll maxm=2e6+7;
const ll mod=1e9+7;
const double eps=1e-10;//精度
using namespace std;
int dp[3000][3000]={0};
string s1,s2;
int max(int x,int y)
{
    return x>y?x:y;
}
void solve()
{
    while(cin>>s1>>s2)
    {
        dp[1][1]=s1[0]==s2[0]?1:0;
        int n1=s1.size(),n2=s2.size();
        for(int i=1;i<=n1;i++)
        {
            for(int j=1;j<=n2;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]);
            }
        }
        cout<<dp[n1][n2]<<'\n';
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
//    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

最长上升子序列

概念

LIS定义：Longest Increasing Subsequence

LIS分类：严格上升与不严格上升（读题时需要注意）。

时间复杂度

通常为O(n²)（转移时直接遍历），最多可优化为O(nlogn)。