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/14863
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
서울에서 경산까지 가는 길에
거치는 마을마다 도보 이동시간, 모금액, 자전거 이동시간, 모금액이 주어졌을 때
주어진 시간안에 경산에 도착하면서 최대한 많은 모금액을 모으는 경우를 구하는 문제입니다.
🔍 풀이 방법
2차원 DP를 이용해서 풀었습니다.
n번째 마을에서 t시간 동안 얻는 모금액을 갱신해가면서 풀었습니다.
⏳ 회고
전형적인 dp 문제였습니다.
1차원 dp로도 풀어봐야될 것 같습니다.