[백준 문제풀이] 얼렁뚱땅 1027번 고층건물 풀이

https://www.acmicpc.net/problem/1027

1027번: 고층 건물

 

n = int(input())
arr = list(map(int,input().split()))
max_num = -1
for i in range(n) :
    my_high = arr[i]
    # left
    left_count = 0
    for j in range(i-1,-1,-1) :
        hello = abs(arr[i] - arr[j])
        sign=0
        for k in range(i-1,j,-1):
            if arr[i] <= arr[j] :
                hey = i-k
            else :
                hey = k-j
            x = (hey * hello) / (i-j)
            if x <= arr[k]-min(arr[j],arr[i]) :
                sign = 1
                break
        if sign == 0 :
            left_count += 1
    # rignt
    right_count = 0
    for j in range(i+1, n) : 
        hello = abs(arr[j] - arr[i])
        sign = 0
        for k in range(i+1,j) :
            if arr[i] <= arr[j] :
                hey = k-i
            else :
                hey = j-k
            x = (hey * hello) / (j-i)
            if x <= arr[k]-min(arr[j],arr[i]) :
                sign = 1
                break
        if sign == 0 :
            right_count += 1

    max_num = max(max_num, left_count+right_count)


print(max_num)