Notice
Recent Posts
Recent Comments
Link
목록17299 (1)
clohi 님의 블로그
[BOJ / Python] 17299 : 오등큰수
https://www.acmicpc.net/problem/17299 문제 코드 - 직접 구현from collections import dequeimport sysMAX_NUM = 1000001input = sys.stdin.readlinen = int(input())li = list(map(int, input().split()))li_cnt = [0] * MAX_NUMfor i in li: li_cnt[i] += 1ans = deque()stack = []while(1): if(len(li) == 0): break x = li[-1] if(len(stack) == 0): stack.append(x) ans.appendleft(-1) ..
Algorithm/BOJ
2025. 9. 28. 23:41