.

백준/동적계획법/11053.py

@@ -0,0 +1,14 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+ar = list(map(int, input().split()))
+
+dp = [1 for _ in range(n)]
+
+for i in range(n):
+    for j in range(i):
+        if ar[i] > ar[j]:
+            dp[i] = max(dp[i], dp[j]+1)
+
+print(max(dp))

백준/동적계획법/11055.py

@@ -0,0 +1,14 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+ar = list(map(int, input().split()))
+
+dp = ar[:]
+
+for i in range(n):
+    for j in range(i):
+        if ar[i] > ar[j]:
+            dp[i] = max(dp[i], dp[j]+ar[i])
+
+print(max(dp))

백준/동적계획법/11727.py

@@ -0,0 +1,13 @@
+import sys
+sys.setrecursionlimit(10**6)
+
+n = int(input())
+
+def f(n):
+    global memo
+    if n >= 3 and len(memo) <=n:
+        memo.append(f(n-1)+f(n-2)*2)
+    return memo[n]
+
+memo = [0, 1, 3]
+print(f(n)%10007)

백준/동적계획법/1912.py

@@ -0,0 +1,11 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+ar = list(map(int, input().split()))
+
+dp = [ar[0]]
+for i in range(len(ar) - 1):
+    dp.append(max(dp[i] + ar[i + 1], ar[i + 1]))
+
+print(max(dp))

백준/동적계획법/22857.py

@@ -3,32 +3,52 @@
 import sys
 input = sys.stdin.readline
 
-n, k = map(int, input().split())
-lst = list(map(int, input().split()))
+# n, k = map(int, input().split())
+# lst = list(map(int, input().split()))
 
-cnt = 0
-start, end = 0, 0
-size, size_max = 0, 0
-flag = 1
+# cnt = 0
+# start, end = 0, 0
+# size, size_max = 0, 0
+# flag = 1
 
-for start in range(n):
-    while cnt <= k and flag:
-        if lst[end] % 2:          # 홀수인 경우
-            if cnt == k:
-                break
-            cnt += 1
-        size += 1
-        if end == n - 1:
-            flag = 0
-            break
-        end += 1
+# for start in range(n):
+#     while cnt <= k and flag:
+#         if lst[end] % 2:          # 홀수인 경우
+#             if cnt == k:
+#                 break
+#             cnt += 1
+#         size += 1
+#         if end == n - 1:
+#             flag = 0
+#             break
+#         end += 1
 
-    if size_max < size - cnt:
-        size_max = size - cnt
+#     if size_max < size - cnt:
+#         size_max = size - cnt
 
-    if lst[start] % 2:    #홀수인 경우
-        cnt -= 1
+#     if lst[start] % 2:    #홀수인 경우
+#         cnt -= 1
 
-    size -= 1
+#     size -= 1
 
-print(size_max)
+# print(size_max)
+
+# 아이디어 떠올리기가 쉽지 않음...ㅜ
+n, k = map(int ,input().split())
+s = [0] + list(map(int, input().split()))
+dp = [[0 for _ in range(k + 1)] for _ in range(n + 1)]
+print(dp)
+
+for i in range(1, n + 1):
+    s[i] %= 2
+    for j in range(k + 1):
+        if s[i] == 0: # 짝수
+            dp[i][j] = dp[i - 1][j] + 1
+        if j != 0 and s[i]: # 홀수
+            dp[i][j] = dp[i - 1][j - 1]
+        print(dp[i])
+    print()
+result = []
+for i in dp:
+    result.append(i[k])
+print(max(result))