[백준][스택] 17298. 오큰수 (파이썬/Python)

import sys
n = int(input())
a = list(map(int, sys.stdin.readline().split()))
answer = [-1] * n
stack = []


stack.append(0)
for i in range(1, n):
    while stack and a[stack[-1]] < a[i]:
        answer[stack.pop()] = a[i]
    stack.append(i)


print(*answer)