Algorithm-Solving/01_Stack/bj_1874.py at main · gh-develop/Algorithm-Solving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
# import sys
#
# sys.stdin = open('bj_1874_in.txt', 'r')
# # open = sys.stdin.readline
#
# n = int(input())
#
# stack = []
# num = 1
# answer = []
#
# for i in range(n):
#     su = int(input())
#
#     while su >= num:
#         stack.append(num)
#         num += 1
#         answer.append('+')
#         answer.append('\n')
#
#     if stack and stack[-1] == su:
#         answer.append("-")
#         answer.append('\n')
#         stack.pop()
#
#     else:
#         answer = ['N', 'O', '\n']
#         break
#
# sys.stdout.write(''.join(answer))


import sys

input = sys.stdin.readline

N = int(input())

remain = 1
stack = []
answer = []   # 출력 버퍼 (문자 단위)

for _ in range(N):
    current = int(input())

    while remain <= current:
        stack.append(remain)
        remain += 1
        answer.append('+')
        answer.append('\n')

    if stack and stack[-1] == current:
        stack.pop()
        answer.append('-')
        answer.append('\n')
    else:
        # answer = ['NO']
        answer = ['N', 'O', '\n']
        break

# for i in answer:
#     print(i)
sys.stdout.write(''.join(answer))