[20251019] BOJ / G5 / 태상이의 훈련소 생활 / 설진영 #1168
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/19951
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개의 칸으로 이루어진 연병장에서 M개의 구간 업데이트 지시를 수행한 후 각 칸의 최종 높이를 구하는 문제
🔍 풀이 방법
각 지시마다 diff[a]에 k를 더하고, diff[b+1]에 k를 빼서 구간 표시
초기 높이에 높이 변화량을 더해 최종 높이 출력
⏳ 회고
태상아 파이팅해라