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/13548
🧭 풀이 시간
35분
👀 체감 난이도
✏️ 문제 설명
길이가 N인 수열에 "구간 [l,r]에 가장 많이 등장하는 수의 등장 횟수를 구하기" 이 작업을 Q번 해보자.
🔍 풀이 방법
수열의 총 길이를 sqrt(N)으로 쪼개서 쿼리의 시작점을 sqrt(N)로 나눈 몫을 기준으로 쿼리를 정렬한다.
정렬 후에 while문으로 매번 직접 l, r을 옮기면서 개수를 세어줬다.
⏳ 회고
개수의 개수를 세어주는게 너무 머리 아프다