[20251015] BOJ / G5 / 꿀 따기 / 김수연 #1129
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/21758
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개의 장소들 중 다른 두 곳을 골라서 벌 한마리씩 두고, 다른 한 장소를 골라서 벌통을 둘 때,
벌들이 딸 수 있는 가능한 최대의 꿀의 양 구하기
🔍 풀이 방법
누적합 + 그리디 사용
누적합으로 왼->오, 오->왼으로 된 누적합 저장해두고,
벌통이 가장 오른쪽, 가장 왼쪽, 중간에 있을 때로 나눠서 최대의 꿀 양 구함
⏳ 회고
으릅다