조예지

def solution(prices): answer = [0] * len(prices) stack = [] for idx, price in enumerate(prices): while stack: if stack[-1][1] > price: node = stack.pop() answer[node[0]] = idx - node[0] else: break stack.append((idx, price)) for node in stack: answer[node[0]] = len(prices) - 1 - node[0] return answer