[20250317] BOJ / 골드4 / 공유기 설치 / 이강현 #249
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
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/2110
🧭 풀이 시간
90분
👀 체감 난이도
✏️ 문제 설명
N개의 집에 C개의 공유기를 설치했을 때 가장 인접한 공유기간의 거리 중 최대 거리를 출력
🔍 풀이 방법
이분탐색
⏳ 회고
이분탐색이라는 것을 알아도 적용하지 못하면 풀기 힘든 것 같다. 이분탐색의 while문 안에서 mid를 이용한 적절한 처리 후 조건을 비교하는 것을 잘 이용하면 좋겠다.