[20250203] BOJ / 골드5 / 차트 / 권혁준 #13
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/1239
🧭 풀이 시간
10분
👀 체감 난이도
✏️ 문제 설명
데이터가 주어지면, 이를 적절히 배치해서 원형 차트를 만들 수 있습니다.
여러 가지 경우가 존재하는데, 이 중 원의 중심을 지나는 선의 최대 개수를 구해야 합니다.
🔍 풀이 방법
순서가 정해지면, 누적 합 배열에서 차이가 50인 원소 쌍의 수를 구해서 해결했습니다.
⏳ 회고
코드 짜면서 순서를 잘못 배치해서 디버깅하는데 오래 걸렸습니다.
실수하지 않도록 신중하게 짜보겠습니다.