Merged
Conversation
lkhyun
changed the title
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/11003
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
N개의 숫자가 주어짐. 그 숫자에서 L만큼 이전 값까지 범위중 최솟값을 찾는 문제.
🔍 풀이 방법
덱
덱의 꼭대기가 항상 최솟값이 되게끔 유지하는 것이 핵심.
새로운 값을 뒤에서부터 넣는데 그 크기가 더 크다면 제거함.
덱의 꼭대기 값은 현재 지점에서 L만큼 이전까지만 유의미하므로 인덱스가 벗어난 경우에 제거.
⏳ 회고
덱을 monotone하게 유지한다는 것을 조금 이해한것 같다.