帖子 def longest_decay_path(input1, input2, input3, input4, input5):

def longest_decay_path(input1, input2, input3, input4, input5): N, M = input1, input2 grid = input3 start_x, start_y = input4, input5 directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] dp = [[-1] * M for _ in range(N)] def dfs(x, y): if dp[x][y] != -1: return dp[x][y] max_len = 1 for dx, dy in directions: nx, ny = x + dx, y + dy if 0 <= nx < N and 0 <= ny < M and grid[nx][ny] < grid[x][y]: max_len = max(max_len, 1 + dfs(nx, ny)) dp[x][y] = max_len return dp[x][y] return dfs(start_x, start_y) //Decay Trail Optimization✅ VIRTUSA✅✅