[20250903] BOJ / G5 / 퇴사 2 / 이강현 #807
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
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
N개의 상담 일자가 있음.
각각의 상담은 걸리는 시간과 소득이 있음.
N일까지만 일하고 퇴사한다고 할때, 가장 큰 소득을 출력.
🔍 풀이 방법
dp
dp[i]는 i일때 얻은 최대 소득을 저장함.
⏳ 회고
ez