[20250621] BOJ / G4 / 호텔 / 김수연 #377
Merged
+33
−0
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/1106
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
최소 C명의 고객으로 늘어나기 위해 사용해야 하는 돈의 최솟값 구하기
🔍 풀이 방법
dp사용
한 도시에서 최대 100명의 고객까지만 늘어날 수 있어서 dp[C] ~ dp[C+99]까지 중에서 최솟값 찾으면 됨
⏳ 회고
dp 배열이 C+100크기인거를 알려면 문제를 꼼꼼히 읽어야겠다.