๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
๊ฐœ๋ฐœ/๐™‚๐™ค๐™ค๐™ง๐™ข ๐™‡๐™€๐™‘๐™€๐™‡

[๊ตฌ๋ฆ„๋ ˆ๋ฒจ] '๋’คํ†ต์ˆ˜๊ฐ€ ๋”ฐ๊ฐ€์›Œ' ํŒŒ์ด์ฌ ํ’€์ด

by beomcoder 2023. 6. 9.
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
๋ฐ˜์‘ํ˜•

๋Œ“๊ธ€