[20251223] BOJ / G5 / 두 개의 탑 / 김민진 #1730
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.
🧷 문제 링크
두 개의 탑
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
원형으로 놓인 탑이 있고 바로 옆 탑과의 사이 거리가 주어짐
임의의 두 탑 사이의 거리는 시계방향, 반시계방향으로 잰 거리 중 짧은 것
임의의 두 탑 사이의 거리 중 최댓값은?
🔍 풀이 방법
투포인터
원형으로 구성되니까 그냥 배열 길이를
2N으로 둬서 일직선상에 탑이 중복으로 놓였다고 가정하고 풀이함시계방향, 반시계방향으로 잰 거리 중 짧은 것이라서
전체 거리 / 2를 넘을 수 없으니까left를 증가시키는 조건을 이걸로 사용⏳ 회고
일일이 현재 거리 안 구하고 누적합 넣어도 되겠네..