기본적인 dp 문제

def solution():
    n = int(input())

    time_table = list(map(int, input().split()))

    dp = [float('inf')] * (n+1)

    dp[0] = time_table[0]
    if n == 1: return dp[0]

    dp[1] = min(max(time_table[0], time_table[1]), dp[0] + time_table[1])

    for i in range(2, n):
        dp[i] = min(dp[i-1]+time_table[i], max(time_table[i], time_table[i-1]) + dp[i-2])
    return dp[n-1]
print(solution())