Skip to content

[Baekjoon-14501] 타임어택 문제 풀이 #166

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
2076070 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

[Baekjoon-14501] 타임어택 문제 풀이 #166

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 15 additions & 0 deletions BOJ/yein/13_week/퇴사.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
# N: 퇴사까지 남은 날
N = int(input())

# dp: idx번째까지 일했을 때의 최대 수익
# 인덱스 주의 :: dp[0] != 1일차
dp = [0 for _ in range(N+1)]

for i in range(N):
# 상담시간 T와 상담비용 P
time, price = map(int, input().split())
today = i+time
for j in range(today, N+1):
if(dp[j]<dp[i]+price): dp[j] = dp[i] + price

print(dp[-1])