LCS最长公共子序列、LIS最长上升子序列、LCIS最长公共上升子序列.pptVIP

LIS（Longest Increasing Subsequence） 1 6 3 2 6 5 4 8 9 6 5 3 6 2 1 3 6 5 4 6 9 6 3 DP[ i ] 代表以第 i 个数字结尾的最长子序列的长度 DP[ i ] = Max ( DP[ j ] + 1) { 1 = j = i - 1} 长沙理工大学 LIS(O(n^2)) LIS（Longest Increasing Subsequence） 1 6 3 4 6 2 4 8 9 6 5 3 6 2 1 3 6 5 4 6 9 6 3 len[ 1 ] = 1 len[ 1 ] = 1 len[2] = 6 len[ 1 ] = 1 len[2] = 3 len[ 1 ] = 1 len[2] = 3 len[3] = 4 len[ 1 ] = 1 len[2] = 3 len[3] = 4 len[4] = 6 len[ 1 ] = 1 len[2] = 2 len[3] = 4 len[4] = 6 len[ 1 ] = 1 len[2] = 2 len[3] = 4 len[4] = 6 len[ 1 ] = 1 len[2] = 2 len[3] = 4 len[4] = 6 len[5] = 8 len[ i ] 代表长度为i的子串的最小结尾的数 LIS(O(nlogn)) 递归输出 LCS(Longest Common Subsequence) O(n^2) B D C A B A A B C B D A B DP[ i ][ j ] 代表以A串第i个字符结尾以B串第j个字符结尾的最长子串 当a[ i ] = b[ j ]时 DP[ i ][ j ] = DP[i - 1][j - 1] + 1 当a[ i ] != b[ j ]时 DP[ i ][ j ] = Max(DP[i - 1][j] , DP[i][j - 1]) LCS(Longest Common Subsequence) LCS(Longest Common Subsequence) LCS(Longest Common Subsequence) LCIS(Longest Common Increasing Subsequence) O(nm) 定义状态F[ i ][ j ]表示以a串的前i个字符b串的前j个字符且以b[ j ]为结尾构成的LCIS的长度 1 2 3 6 4 5 1 2 3 4 5 7 当a[ i ] != b[ j ] F[ i ][ j ] = F[ i - 1][ j ] 当a[ i ] == b[ j ] F[ i ][ j ]=max(F[ i-1 ][ k ])+1 1=k=j-1b[ j ]b[ k ] LCIS(Longest Common Increasing Subsequence) O(nm) LCIS(Longest Common Increasing Subsequence)