Merge pull request #15 from Mingguriguri/minjeong

Minjeong / 4월 1주차 / 4문제

Author: JYP0824

minjeong/DynamicProgramming/2024-04-01-[백준]-#11053-가장긴증가하는부분수열.py

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

minjeong/DynamicProgramming/2024-04-04-[백준]-#2565-전깃줄.py

@@ -0,0 +1,16 @@
+n = int(input())
+lists = []
+dp = [1]*n
+
+for i in range(n):
+  a, b = map(int, input().split())
+  lists.append([a, b])
+
+lists.sort()
+
+for i in range(1, n):
+  for j in range(0, i):
+    if lists[j][1] < lists[i][1]:
+      dp[i] = max(dp[i], dp[j]+1)
+      
+print(n-max(dp))

minjeong/DynamicProgramming/2024-04-05-[백준]-#11726-2xn타일링.py

@@ -0,0 +1,9 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+
+dp = [1] * (n+1)
+for i in range(2, n+1):
+    dp[i] = (dp[i-1] + dp[i-2])%10007
+print(dp[n])

minjeong/DynamicProgramming/2024-04-06-[백준]-#9095-123_더하기.py

@@ -0,0 +1,10 @@
+import sys
+input = sys.stdin.readline
+dp = [1] * 12
+dp[2] = 2
+t = int(input())
+for _ in range(t):
+    n = int(input())    
+    for i in range(3, n+1):
+        dp[i] = dp[i-1] + dp[i-2] + dp[i-3]
+    print(dp[n])