Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/17299
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
수열에서 특정 인덱스의 수보다 오른쪽에 있는 수 중에 현재 수보다 출현 빈도가 높은 수를 오등큰수라고 하는데 그 수 중 위치가 가장 가까운 수를 구하는 문제입니다.
🔍 풀이 방법
수열과, 최대 100만 까지기 때문에 100만 크기의 빈도 배열을 만들었습니다.
그 각 수의 오른쪽을 계산하기 때문에 역으로 맨 오른쪽 부터 찾았습니다.
스택을 이용햇습니다.
⏳ 회고
문제 설명이 어려웠습니다