Python 滑雪问题

滑雪

这道题有两种解法，一种是采用记忆化+DFS，一种是采用记忆化+DP，前者会TLE（1.2s了！！！），后者AC（32ms左右！！！）

记忆化+DP大法好！

下面分别来看一下这两者的代码

记忆化搜索

m, n = map(int, input().split())
grids = []
for _ in range(m):
    grids.append(list(map(int, input().split())))
class Solution:
    def find(self, grids, m, n):
        res = 1
        for i in range(m):
            for j in range(n):
                res = max(res, self.dfs(grids, i, j))
        return res
    def dfs(self, grids, i, j):
        dp = [[1] * n for _ in range(m)]
        for new_i, new_j in [(i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)]:
            if 0 <= new_i < m and 0 <= new_j < n and grids[new_i][new_j] < grids[i][j]:
                dp[i][j] = max(dp[i][j], 1 + self.dfs(grids, new_i, new_j))
        return dp[i][j]
f = Solution()
res = f.find(grids, m, n)
print(res)

记忆化 + DP
其实就是使用了优先队列！

DP要考虑无后效性，所以采用优先队列，将所有元素放入heap中，先算较低的点，对后面算高的点没有影响。

from heapq import *
m, n = map(int, input().split())
grids = []
for _ in range(m):
    grids.append(list(map(int, input().split())))
class Solution:
    def dfs(self, grids):
        pq = []
        for i in range(m):
            for j in range(n):
                heappush(pq, (grids[i][j], i, j))
        dp = [[1] * n for _ in range(m)]
        res = 1
        while pq:
            w, i, j = heappop(pq)
            for new_i, new_j in [(i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)]:
                if 0 <= new_i < m and 0 <= new_j < n and grids[new_i][new_j] < w:
                    dp[i][j] = max(dp[i][j], 1 + dp[new_i][new_j]) # dp[new_i][new_j]一定是更新过的，所以这里直接读取就可以！
                    res = max(res, dp[i][j])
        return res
f = Solution()
res = f.dfs(grids)
print(res)