------
## 最终结论
```python
def max_path_sum(triangle, row, col):
    # Start from the second last row and move upwards
    for r in range(row - 1, -1, -1):
        for c in range(r + 1):
            # Update the current cell with the maximum path sum from below
            triangle[r][c] += max(triangle[r + 1][c], triangle[r + 1][c + 1])
    return triangle[0][0]

# Test cases
assert max_path_sum([[1, 0, 0], [4, 8, 0], [1, 5, 3]], 2, 2) == 14
assert max_path_sum([[13, 0, 0], [7, 4, 0], [2, 4, 6]], 2, 2) == 24
assert max_path_sum([[2, 0, 0], [11, 18, 0], [21, 25, 33]], 2, 2) == 53
```