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/1245
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
N×M 격자에서 산봉우리의 개수를 세는 문제
8방향으로 인접한 모든 격자가 산봉우리보다 낮아야 함
🔍 풀이 방법
BFS로 같은 높이의 연결된 영역을 탐색, 탐색 중 인접한 격자 중 더 높은 곳이 있으면 산봉우리가 아님
방문하지 않은 모든 위치에 대해 탐색하며 산봉우리 개수 카운트
⏳ 회고
쉽네요