๊ฐ๋ฐ/๐๐ค๐ค๐ง๐ข ๐๐๐๐๐
[๊ตฌ๋ฆ๋ ๋ฒจ] '๋คํต์๊ฐ ๋ฐ๊ฐ์' ํ์ด์ฌ ํ์ด
beomcoder
2023. 6. 9. 15:01
728x90
๋ฐ์ํ
https://level.goorm.io/exam/167337/%EB%92%A4%ED%86%B5%EC%88%98%EA%B0%80-%EB%94%B0%EA%B0%80%EC%9B%8C/quiz/1
๊ตฌ๋ฆLEVEL
๊ตฌ๋ฆLEVEL ๋ฌธ์ ๋ฅผ ํ์ดํ๊ณ ๋ถ์กฑํ ๋ถ๋ถ์ ๋ณด์ํ๋ฉฐ ์ค๋ ฅ์ ํค์๋ณด์ธ์. ๊ตฌ๋ฆLEVEL์ ์ฝ๋ฉํ ์คํธ์์ ๊ฐ์ฅ ๋์ ๋น์ค์ ์ฐจ์งํ๋ ์๊ณ ๋ฆฌ์ฆ ๋ฌธ์ ๋ฅผ ์ ์ํ๊ณ ํ์ดํ ์ ์๋ ์จ๋ผ์ธ ์ ์ง ์๋น์ค์
level.goorm.io
# -*- coding: utf-8 -*-
# UTF-8 encoding when using korean
_ = input()
peaks = list(map(int, input().split()))
answer = [0]
before = [peaks[0]]
for i, v in enumerate(peaks[1:]):
answer.append(len(before))
while True:
if before[-1] <= v:
before.pop()
else:
before.append(v)
break
if len(before) == 0:
before.append(v)
break
print(*answer)
# _ = input()
# peaks = list(map(int, input().split()))
# answer = []
# for cur in range(len(peaks)-1, 0, -1):
# _max = 0
# count = 0
# for i in range(len(peaks[:cur-1]), -1, -1):
# if _max < peaks[i]:
# _max = peaks[i]
# count += 1
# answer.append(count)
# answer.append(0)
# print(*answer[::-1])
'''
์ฒ์์ ์๋ ์ฃผ์์ฒ๋ผ ํ์๋ค.
์๊ฐ์ด๊ณผ๊ฐ ๋์ ์ด๋ป๊ฒ ํ์ด์ผํ ์ง ๊ณ ๋ฏผํ๋ค๊ฐ ๋ณผ์์๋ ๊ฐ์๋ฅผ ์ ์ฅํด๋๊ณ
๊ทธ๊ฒ๋ง ๋น๊ตํ๊ฒ ๋ฐ๊พธ์๋ค.
'''728x90
๋ฐ์ํ