[20250825] BOJ / G5 / 개똥벌레 / 김수연 #737
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/3020
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
개똥벌레 한 마리가 동굴을 지나갈 때, 파괴해야하는 장애물의 최솟값과 그러한 구간이 몇 개 있는지 구하기
(석순은 밑, 종유석은 위)
🔍 풀이 방법
누적합 이용
입력을 받으면서 석순과 종유석 높이에 해당하는 인덱스에 1을 더하고, 입력을 다 받은 후에 인덱스 내림차순으로 누적합 구함
A, B 배열은 인덱스를 높이로 설정
⏳ 회고
난 누적합이 너무 어렵다 진짜