[SWEA][S/W 문제해결 기본][Python] 1206 View

[문제]

https://swexpertacademy.com/main/talk/solvingClub/problemView.do?contestProbId=AV134DPqAA8CFAYh&solveclubId=AV6kld8aisgDFASb&problemBoxTitle=%5BD2%7ED3+%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4%5D+%EA%B8%B0%EC%B4%88+%EB%8B%A4%EC%A7%80%EA%B8%B0+Part3&problemBoxCnt=14&probBoxId=AV-HZfeqN3ADFASP

SW Expert Academy

 

 

[코드]

>> 왼쪽 -1, -2번째 높이 확인

>> 오른쪽 +1, +2번째 높이 확인 

>> 왼쪽, 오른쪽 값 중 작은 값을 카운트 해준다. 

for i in range(1,11):
    n = int(input())
    x = list(map(int,input().split()))
    cnt = 0
    for j in range(2,n-1):
        if (x[j]-x[j-1])>0 and (x[j]-x[j-2])>0:
            left = x[j]-max(x[j-1],x[j-2])
            if (x[j]-x[j+1])>0 and (x[j]-x[j+2])>0:
                right = x[j]-max(x[j+1],x[j+2])
                cnt += min(left,right)

    print("#"+str(i),cnt)