https://programmers.co.kr/learn/courses/30/lessons/42588

탑.py

def solution(heights):
    diff = []
    for idx in range(len(heights)-1):
        diff.insert(len(diff), heights[idx] - heights[idx+1])
    
    receives =  [0]
    for idx in range(len(diff)):
        recv = 0
        for t in range(idx, -1, -1):
            if sum(diff[t:idx+1]) > 0:
                recv = t + 1
                break
        
        receives.append(recv)
    return receives