[20251103] BOJ / G2 / 로봇 조종하기 / 한종욱 #1301
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/2169
🧭 풀이 시간
90분
👀 체감 난이도
✏️ 문제 설명
로봇이 왼쪽, 오른쪽, 아래쪽으로 이동하는데 (1, 1)에서 (N, M)까지 가는 최대의 탐사 가치를 출력하라
🔍 풀이 방법
첫 열은 왼쪽으로 가는 처리하고, 다음부터 위에서 먼저 다 내려서 max를 체크하고 왼쪽, 오른쪽으로 쓸어가면서 처리한다.
⏳ 회고
어려웠던 건 맨 끝은 위에껄 내려서 가져와야 했다는 점이다.