[SWExpertAcademy] 1206. View

 

---

문제링크

 

---

T = 10
for test_case in range(1, T + 1):
    width = int(input())
    height = list(map(int,input().split()))
    result = 0
    for i in range(2,width-2):
        view = [height[(i-2)],height[(i-1)],height[(i+1)],height[(i+2)]]
        if height[i] > max(view):
            result += height[i] - max(view)
    print("#{} {}".format(test_case,result))