[20251202] BOJ / G4 / 자두나무 / 이준희 #1567
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/2240
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
2개의 자두나무가 있고 매 초 어느 자두나무에서 자두가 떨어질지 알 수 있을 때
T초동안 최대 W번 이동해서 받을 수 있는 자두의 개수를 구하는 문제입니다.
🔍 풀이 방법
dp를 사용해서 문제를 풀었습니다.
3차원 dp를 이용해서 t초에 w번이동해서 1번, 2번 나무에 위치했을 때
받을 수 있는 열매를 갱신하면서 마지막 T초의 값 중 최대값을 구했습니다.
⏳ 회고
처음에 1번에서 시작한다는 것을 생각 안햇다가 시간을 썼습니다.