[BOJ] 11722 가장 긴 감소하는 부분 수열 (S2)

Author: jihostudy

김지호/3주차/2601013.py

@@ -0,0 +1,19 @@
+# https://www.acmicpc.net/problem/11722
+import sys
+from collections import defaultdict
+from collections import deque
+
+sys.stdin = open("../input.txt",'r')
+
+
+N = int(input())
+numbers = list(map(int,input().split()))
+
+dp = [1] * N
+
+for i in range(N):
+  for j in range(0, i):
+    if numbers[i] < numbers[j] :
+      dp[i] = max(dp[i], dp[j]+1)
+
+print(max(dp))