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.
🧷 문제 링크
휴게소 세우기
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
고속도로에
N개의 휴게소가 있고M개의 휴게소를 더 세우려 할 때 휴게소 간 거리의 최댓값의 최솟값은?🔍 풀이 방법
매개변수 탐색
공유기 설치랑 비슷한데 공유기는 최솟값의 최댓값이고 얘는 최댓값의 최솟값
최댓값의 최솟값을
mid로 두고 각 휴게소 사이에 몇 개의 휴게소를 추가 설치해야하는지 구함최대의 최소니까 마지막에 나온
left가 답⏳ 회고
L과 그 앞의 휴게소 간 거리도 고려해야함!