[20251016] BOJ / G5 / 사과나무 / 김수연 #1137
Merged
+33
−0
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/20002
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
사과를 통해 얻은 총이익을 2차원 배열 형태로 정리했을 때, 형곤이가 얻을 수 있는 최대 총이익 구하기
🔍 풀이 방법
누적합 이용
arr배열에 각 지점까지의 누적합 저장해두고,
3중 for문 이용해서 사각형 크기 정해서 각 오른쪽하단 끝점 기준으로 총이익 구함
⏳ 회고
누적합....으릅다..