[20250903] BOJ / G5 / 퇴사 2 / 이준희 #805
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/15486
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
백준이가 n일 후에 퇴사 하려고 n일 동안 최대한 많은 돈을 땡기려고 합니다.
이 때 각 일차별로 걸리는 시간과 그에 대한 보수가 주어졌을 때 퇴사할 때 가장 많이 벌어서 나갈 수 있는 경우의 수익을 구하는 문제입니다.
🔍 풀이 방법
dp를 이용하여 풀었습니다.
1일차에 책정된 일이 3일이 걸리고 보수가 20 이라면 dp[4]=20 으로 저장하고
n일을 순회하면서 dp[현재일+걸리는시간] = math.max(dp[현재일+걸리는시간], dp[현재일]+오늘 받은 일의 보수) 식을 이용했습니다.
⏳ 회고
설명이 조금 어렵게 됐는데 풀어보면 쉽게 풀 수 있는 문제였습니다.