Merge pull request #142 from AlgoLeadMe/40-tgyuuAn

40-tgyuuAn

tgyuuAn/DP/입대.py

@@ -0,0 +1,30 @@
+import sys
+
+remain_days, need_score = map(int,sys.stdin.readline().split())
+volunteer_scores = [0]
+volunteer_scores.extend(list(map(int,sys.stdin.readline().split())))
+
+blood_donation_score, blood_donation_break_time = map(int,sys.stdin.readline().split())
+
+volunteer_scores.extend([0 for _ in range(blood_donation_break_time-1)])
+maximum_blood_donation_count = (len(volunteer_scores)+blood_donation_break_time-1)//blood_donation_break_time+1
+
+dp_table = [[0 for _ in range(maximum_blood_donation_count)] for _ in range(len(volunteer_scores))]
+
+for date in range(len(volunteer_scores)):
+    if date >= blood_donation_break_time:
+        for blood_donation_count in range(1,maximum_blood_donation_count):
+            dp_table[date][blood_donation_count] = max(dp_table[date][blood_donation_count],
+                                                       dp_table[date-1][blood_donation_count] + volunteer_scores[date],
+                                                       dp_table[date-blood_donation_break_time][blood_donation_count-1] + blood_donation_score)
+
+    dp_table[date][0] = dp_table[date-1][0] + volunteer_scores[date]
+
+print(dp_table)
+
+for count in range(len(dp_table[-1])):
+    if dp_table[-1][count] >= need_score:
+        print(count)
+        break
+
+else: print(-1)

tgyuuAn/README.md

@@ -41,4 +41,5 @@
 | 37차시 | 2023.02.04 |  BFS  | <a href="https://www.acmicpc.net/problem/1039">교환</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/131
 | 38차시 | 2023.02.15 |  DP  | <a href="https://www.acmicpc.net/problem/2749">피보나치 수 3</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/137
 | 39차시 | 2023.02.18 |  DP  | <a href="https://www.acmicpc.net/problem/7579">앱</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/139
+| 40차시 | 2023.02.21 |  DP  | <a href="https://www.acmicpc.net/problem/31413">입대</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/142
 ---