[20251015] BOJ / G5 / 꿀 따기 / 설진영 #1132
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
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
N개의 장소가 일렬로 배치되어 있고, 각 장소마다 꿀의 양이 정해져 있음
두 마리의 벌과 벌통 하나를 배치하여 벌들이 수집할 수 있는 꿀의 양을 최대화
🔍 풀이 방법
두 벌이 왼쪽에서 출발 → 오른쪽 벌통
두 벌이 오른쪽에서 출발 → 왼쪽 벌통
양쪽 끝에 벌, 중간에 벌통
세개중에 잴 큰거
누적합 미리 구해둬서 불필요한 추가 연산 막기
⏳ 회고
누적합 잘쓰면 쉬울듯