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/13397
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
배열에 구간을 나눌껀데 그 구간은 M개 이하여야 한다. 모든 구간의 [최댓값 - 최소값]의 최댓값의 최솟값을 구하라
🔍 풀이 방법
최댓값의 최솟값을 이분탐색으로 구하고,
해당 값이 진짜 최댓값의 최솟값이 될 수 있는지 구한다.
⏳ 회고
이분탐색에서 언제
<=를 쓰고 언제<를 쓰는지 잘 모르겠다.<=: 조건을 만족하는 최솟값/최댓값을 찾을 때<: 특정 값의 정확한 위치를 찾을 때라는데 더 많이 풀어봐야겠다.