Python数据结构与算法（poj）：P01080——Human Gene Functions

OpenJudge - 01080:Human Gene Functions

        这道题上来一看，给你两个字符串，可以往里面随便（有一定的要求）加“-”，从而是匹配值最大，那显然就使用动态规划。

        很轻松就可以得到状态转移方程：

                            

同时注意一下初始化就可以愉快地写出代码啦~

graph = {letter: {} for letter in ['A', 'C', 'G', 'T', '-']}
graph['A']['A'] = graph['C']['C'] = graph['G']['G'] = graph['T']['T'] = 5
graph['A']['C'] = graph['C']['A'] = graph['A']['T'] = graph['T']['A'] \
    = graph['-']['T'] = graph['T']['-'] = -1
graph['A']['-'] = graph['-']['A'] = graph['C']['G'] = graph['G']['C'] = -3
graph['A']['G'] = graph['G']['A'] = graph['C']['T'] = graph['T']['C'] \
    = graph['G']['T'] = graph['T']['G'] = graph['G']['-'] = graph['-']['G'] = -2
graph['C']['-'] = graph['-']['C'] = -4

for _ in range(int(input())):
    n, s1 = input().split()
    m, s2 = input().split()
    n, m = int(n), int(m)
    dp = [[0 for _ in range(m+1)] for _ in range(n+1)]
    for i in range(1, n+1):
        dp[i][0] = dp[i-1][0] + graph[s1[i-1]]['-']
    for j in range(1, m+1):
        dp[0][j] = dp[0][j-1] + graph['-'][s2[j-1]]
    for i in range(1, n+1):
        for j in range(1, m+1):
            dp[i][j] = max(
                dp[i-1][j-1] + graph[s1[i-1]][s2[j-1]],
                dp[i-1][j] + graph[s1[i-1]]['-'],
                dp[i][j-1] + graph['-'][s2[j-1]]
            )
    print(dp[n][m])