1206. [S/W 문제해결 기본] 1일차 - View

문제

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV134DPqAA8CFAYh

SW Expert Academy

 

 

 

풀이

for test_case in range(1, 11):
    n = int(input())
    height=list(map(int,input().split()))
    num_house=0
    for j in range(2,n-2):
        left=max(height[j-2],height[j-1])
        right=max(height[j+1],height[j+2])
        if left>height[j] or right>height[j]:
            continue
        else:
            num_house+=(height[j]-max(left,right))
    print(f"#{test_case} {num_house}")