[20250721] BOJ / G4 / 스카이라인 쉬운거 / 이강현 #515
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/1863
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
해가 질때 도시의 그림자보고 건물 수 세셈.
🔍 풀이 방법
스택
스택에 비어있을때 0보다 크면 넣고 스택의 꼭대기보다 작으면 계속 빼셈. 뺄때마다 카운트
꼭대기보다 크면 그냥 넣으셈.
글고 마지막에는 스택에 남아있는거 있으니까 그거 더해주셈.
⏳ 회고
맞을줄 몰랐는데 맞았음. 오바 근데 직관적으로 맞는거 같음