def solution(prices):
    n = len(prices)
    answer = [n - 1 - idx for idx in range(n)]
    stack = []

    for i, price in enumerate(prices):
        while stack and price < prices[stack[-1]]:
            top = stack.pop()
            answer[top] = i - top
        stack.append(i)

    return answer