滑雪问题

是一个滑雪选手从高山上往下滑，会遇到不同的checkpoint，每一个checkpoint有自己的point，然后每个edge有distance。经过每一个checkpoint所得到的score是通过一个包含point和distance的式子算出来的（比如2 * point +distance之类的）。最终求从最高点往下滑能得到的最大score是多少

from collections import deque

def calculate_max_scores(points, graph, start_node):
    max_scores = {node: -float('inf') for node in points}
    
    if start_node in max_scores:
        max_scores[start_node] = 2 * points[start_node]

    queue = deque([start_node])
    
    while queue:
        u = queue.popleft()
        if u in graph:
            for v, dist in graph[u]:
                new_score = max_scores[u] + (2 * points[v] + dist)
                if new_score > max_scores[v]:
                    max_scores[v] = new_score
                    queue.append(v)
                    
    return max_scores

if __name__ == "__main__":
    points_data = {
        'A': 5, 'B': 7, 'C': 6, 'D': 2, 
        'E': 1, 'F': 7, 'H': 7, 'I': 3, 'J': 2
    }

    graph_data = {
        'A': [('B', 2), ('C', 3)],
        'B': [('D', 5), ('E', 6)],
        'C': [('E', 4), ('F', 4)],
        'D': [('H', 7)],
        'E': [('H', 6)],
        'F': [('J', 3)],
        'H': [('I', 1), ('J', 2)],
        'I': [],
        'J': []
    }

    results = calculate_max_scores(points_data, graph_data, 'A')

    print("--- 节点最大得分统计 ---")
    for node, score in results.items():
        if score != -float('inf'):
            print(f"节点 {node}: {score}")
            
    print("\n--- 最终目标 ---")
    final_max = max(results['I'], results['J'])
    print(f"到达 I 或 J 的最高分是: {final_max}")