[백준] 17298 - 오큰수

1. 문제

 

2. 코드

n = int(input())
l = list(map(int, input().split()))
stack = []
answer = [-1 for i in range(n)]

for i in range(n-1):
    stack.append(i)
    while 1:
        if len(stack) == 0:
            break
        if l[stack[-1]] < l[i+1]:
            #print(l[i+1])
            answer[stack[-1]] = l[i+1]
            stack.pop()
        else:
            break

for i in range(n):
    print(answer[i])

 

3. 풀이