🟩 [백준] [Python] [Gold5] 2493번_탑

문제

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

2493번: 탑

풀이

# 백준 2493번 문제 - 탑
import sys
input = sys.stdin.readline
n = int(input())
tops = list(map(int, input().split()))
answer = [0] * n
stack = []
for i in range(len(tops)):
    while stack:
        if tops[stack[-1][0]] < tops[i]:
            stack.pop()
        else:
            answer[i] = stack[-1][0] + 1
            break
    stack.append((i, tops[i]))
print(*answer)