LCS最长公共子序列和LIS最长上升子序列——例题剖析

一.LCS最长公共子序列

最长公共子序列（LCS）问题算法详解+例题（转换成LIS，优化为O(nlogn)，看不懂你来打我）

longest comment subsequence

模板题
longest comment subsequence
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

思路：这是一道LCS模板题，lcs就是longest common subsequence,最长公共子序列。要求其长度，当然可以暴力跑，但肯定会超时，所以可以用dp来做。两个字符串遍历一遍，遇到相同的就+1，否则就取最大值。

#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"OK"<<endl
typedef long long ll;
const int maxn=1e3+1;
const int mod=1e9+7;
int n,len1,len2,dp[maxn][maxn];
string s1,s2;
void lcs(int a,int b)
{
   
    for(int i=1;i<=a;i++)//O(nm)
        for(int j=1;j<=b;j++)
        {
   
            if(s1[i-1]==s2[j-1])//有相同的就+1
                dp[i][j]=dp[i-1][j-1]+1;
            else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);//否则就取上一个得到答案中的最大值
        }