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/2240
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
T초 동안 두 나무 중 하나에서 자두가 떨어진다.
자두는 1번 나무에서 시작하며, 최대 W번 이동하여 최대한 많은 자두를 받아야 한다.
🔍 풀이 방법
dp[t][w] = t초까지 w번 이동했을 때 최대 자두 개수
점화식: dp[t][w] = max(dp[t-1][w], dp[t-1][w-1]) + (현재 위치에서 자두가 떨어지면 1)
⏳ 회고
전형적인 2차원 dp 쉬움ㅋ