def max_path_sum(tri, m, n):
    # Work from bottom up, accumulating max sums
    dp = [row[:] for row in tri]
    
    for i in range(m - 2, -1, -1):
        for j in range(i + 1):
            dp[i][j] += max(dp[i + 1][j], dp[i + 1][j + 1])
    
    return dp[0][0]