[20251006] BOJ / G3 / 두 직사각형 / 권혁준 #1056
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/9061
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
N개의 점을 모두 포함하는 두 직사각형 중 넓이가 큰 사각형의 넓이를 최소화해보자.
🔍 풀이 방법
L[i] = 1~i번째 점까지 포함하는 직사각형 넓이R[i] = i~N번째 점까지 포함하는 직사각형 넓이좌표 정렬하고 위 식대로 값을 구해서 max(L[i-1], R[i]) 중 최솟값을 출력해줬다.
⏳ 회고
좌표 정렬을 x축 기준, y축 기준 둘 다 해야 하는데 하나만 해서 틀렸었음