[20250827] BOJ / G1 / 구간 합 구하기 / 이준희 #752
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/2042
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
배열이 주어졌을 때
특정 부분의 원소를 바꿔가며 구간합을 구하는 문제입니다.
🔍 풀이 방법
세그먼트 트리를 구현하여 풀었습니다.
어제 풀었던 문제에서 각 노드가 최대, 최소값을 저장하였다면
이 문제에서는 노드마다 자식노드들의 합을 계산하여 저장했습니다.
⏳ 회고
세그먼트 트리 2일차였습니다.
어제는 update는 사용하지 않는 문제였지만 이번 문제는 update를 해야하는 문제였습니다.
슬슬 외워가고 있는 것 같습니다.