[20250710] BOJ / G4 / 휴게소 세우기 / 김수연 #429
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/1477
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
고속도로에 휴게소 N개가 있을 때, M개를 더 세우려고 한다.
M개의 휴게소를 짓고 난 후, 휴게소가 없는 구간의 최댓값의 최솟값 구하기
🔍 풀이 방법
이분탐색 이용
pos에 저장되어 있는 휴게소의 위치를 mid값으로 나눠서 몇개의 휴게소를 더 만들어야 하는지 cnt에 저장
이후, cnt가 M보다 크면 start = mid + 1로
cnt가 M보다 같거나 작으면 end = mid - 1로 만들어줌
⏳ 회고
완전 전형적인 이분탐색인데.. 헤맸다..