Merge pull request #67 from YoonYn9915/main

YoonYn9915 / 10월 1주차 / 2문제

Author: Mingguriguri

YoonYn9915/dp/2024-10-07-[백준]-#13301-타일 장식물.py

@@ -0,0 +1,14 @@
+n = int(input())
+
+dp = [1, 1, 2, 3, 5, 8]
+
+if n > 5:
+    for i in range(6, n):
+        dp.append(dp[i-1] + dp[i-2])
+
+ans = (dp[n-1] * 2) + ((dp[n-1] + dp[n-2]) * 2)
+
+if n == 1:
+    ans = 4
+
+print(ans)

YoonYn9915/dp/2024-10-07-[백준]-#18353-병사 배치하기.py

@@ -0,0 +1,19 @@
+
+def sort(arr,dp):
+    global N
+
+    for i in range(1,N,1):
+        for j in range(i-1,-1,-1):
+            if arr[j] > arr[i]:
+                dp[i] = max(dp[i],dp[j]+1)
+
+
+N = int(input())
+
+arr = list(map(int,input().split()))
+dp = [1] * N
+
+sort(arr, dp)
+
+print(N-max(dp))
+