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/2096
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
열이 3개이고 n개의 행이 있는 배열이 있을 때 배열을 내려갈 때는 바로 아래에 있거나 그 인접한 칸으로만 내려갈 수 있습니다.
이 때 내려가면서 더한 숫자들이 최대인 값과 최소인 값을 구하는 문제입니다.
🔍 풀이 방법
최대, 최소를 구할 dp 배열을 각각 사용해서 내려가면서 풀었습니다. 열이 3개로 적었기 때문에 하드코딩 했습니다.
⏳ 회고
간단한 dp 문제였습니다.