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/27651
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
벌레의 머리 가슴 배를 나눌 껀데, 머리 < 배, 배 < 가슴의 경우의 수는?
🔍 풀이 방법
X를 하나씩 고정하고, Y를 이분탐색으로 진행한다. 이때, 하나하나 개수를 세는 것이 아니라 lowerBound, upperBound를 계산해서 개수를 센다.
⏳ 회고
lowerBound, upperBound로 계산하는건 참신했다. 하나씩 세면 시간초과가 발생한다.