Merge pull request #148 from AlgoLeadMe/41-tgyuuAn

41-tgyuuAn

tgyuuAn/DP/자두나무.py

@@ -0,0 +1,37 @@
+import sys
+
+def input(): return sys.stdin.readline()
+
+T, W = map(int,input().split())
+
+# DP[i][j][k] i초에 [j]위치에 있고 [k]번의 횟수를 이동했을 때 받을 수 있는 자두 수
+DP = [[[0 for _ in range(W+1)] for _ in range(2+1)] for _ in range(T+1)]
+
+plums = []
+for _ in range(T):
+    plums.append(int(input()))
+
+for time, plum in zip(range(1,T+1), plums):
+
+    for k in range(W+1):
+        if k == 0:
+            if plum == 1:
+                DP[time][1][k] = DP[time-1][1][k]+1
+                DP[time][2][k] = DP[time-1][2][k]
+
+            else:
+                DP[time][1][k] = DP[time-1][1][k]
+                DP[time][2][k] = DP[time-1][2][k]+1 
+            continue
+
+        if plum == 1:
+            DP[time][1][k] = max(DP[time-1][1][k],DP[time-1][2][k-1])+1
+            DP[time][2][k] = max(DP[time-1][1][k-1],DP[time-1][2][k])
+
+        else:
+            DP[time][1][k] = max(DP[time-1][1][k],DP[time-1][2][k-1])
+            DP[time][2][k] = max(DP[time-1][1][k-1],DP[time-1][2][k])+1
+
+    DP[time][2][0] = 0
+
+print(max([max(x) for x in DP[-1]]))

tgyuuAn/README.md

@@ -42,4 +42,5 @@
 | 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
+| 41차시 | 2023.03.04 |  DP  | <a href="https://www.acmicpc.net/problem/2240">자두나무</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/148
 ---