์ฝ”ํ…Œ์ค€๋น„

<์ž๋ฃŒ ๊ตฌ์กฐ> ๋ฐฑ์ค€ 11279๋ฒˆ. ์ตœ๋Œ€ ํž™ (์‹ค๋ฒ„ 2) - ์‹œ๊ฐ„ ์ดˆ๊ณผ

์š”๋Œœ๋‹ค 2022. 12. 31. 16:25

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

 

11279๋ฒˆ: ์ตœ๋Œ€ ํž™

์ฒซ์งธ ์ค„์— ์—ฐ์‚ฐ์˜ ๊ฐœ์ˆ˜ N(1 ≤ N ≤ 100,000)์ด ์ฃผ์–ด์ง„๋‹ค. ๋‹ค์Œ N๊ฐœ์˜ ์ค„์—๋Š” ์—ฐ์‚ฐ์— ๋Œ€ํ•œ ์ •๋ณด๋ฅผ ๋‚˜ํƒ€๋‚ด๋Š” ์ •์ˆ˜ x๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. ๋งŒ์•ฝ x๊ฐ€ ์ž์—ฐ์ˆ˜๋ผ๋ฉด ๋ฐฐ์—ด์— x๋ผ๋Š” ๊ฐ’์„ ๋„ฃ๋Š”(์ถ”๊ฐ€ํ•˜๋Š”) ์—ฐ์‚ฐ์ด๊ณ , x๊ฐ€ 0

www.acmicpc.net

from collections import deque
import sys
input = sys.stdin.readline

n = int(input())
lst = []
q = deque()
for i in range(n):
  a = int(input())
  if a == 0:
    if q:
      pr = max(q)
      print(pr)
      idx = q.index(pr)
      del q[idx]
    else :
      print(0)
  else :
    q.append(a)

์‹œ๊ฐ„์ดˆ๊ณผ๊ฐ€ ๋–ด๋‹ค..