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
2 participants
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/2357
🧭 풀이 시간
80분
👀 체감 난이도
✏️ 문제 설명
배열이 주어지고 시작 인덱스와 끝 인덱스가 주어졌을 때
시작 인덱스와 끝 인덱스 사이의 값 중 최솟값과 최댓값을 구하는 문제입니다.
🔍 풀이 방법
세그트리를 사용하여 풀었습니다.
기존의 구간합을 구하는 부분에서 min을 사용하여 각 노드에 작은값이 저장되게 하였습니다.
⏳ 회고
세그트리를 배우지 않으면 풀 수 있는 골드 문제가 너무 적어져서 BOJ 사이트의 세그트리 자료를 보고 학습했습니다.
오늘은 배우면서 풀어서 풀 수 있었던 것 같습니다