摘要:
Human Gene Functions 题意: LCS: 设dp[i][j]为前i,j的最长公共序列长度; dp[i][j] = dp[i-1][j-1]+1;(a[i] == b[j]) dp[i][j] = max(dp[i][j-1],dp[i-1][j]); 边界:dp[0][j] = 0 阅读全文
posted @ 2016-03-16 22:47
yoyo_sincerely
阅读(245)
评论(0)
推荐(0)
浙公网安备 33010602011771号