def max_sum(tri, n):
    if n == 0:
        return 0
    
    # Create a copy of the triangle to store dp values
    dp = [row[:] for row in tri]
    
    # Bottom-up dynamic programming
    for i in range(n - 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]