[백준 알고리즘] 1974번 스택 수열 (Python)

 

 

 

<Python>

N = int(input())

stack = []
check = 1
answer = []
possibility = True

for i in range(N):
    num = int(input())
    while check <= num:
        stack.append(check)
        answer.append('+')
        check += 1
    if stack[-1] == num:
        stack.pop()
        answer.append('-')
    else:
        possibility = False

if possibility is False:
    print("NO")
else:
    print("\n".join(answer))

 

▼ 링크

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

1874번: 스택 수열