From 40011062fe80a77a4abc2a7ccc073feb85e1f36e Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Mon, 28 Jul 2025 07:56:54 +0900
Subject: [PATCH] =?UTF-8?q?[20250728]=20BOJ=20/=20G4=20/=20=EA=B0=80?=
 =?UTF-8?q?=EC=9E=A5=20=EA=B8=B4=20=EB=B0=94=EC=9D=B4=ED=86=A0=EB=8B=89=20?=
 =?UTF-8?q?=EB=B6=80=EB=B6=84=20=EC=88=98=EC=97=B4=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\353\266\204 \354\210\230\354\227\264.md" | 50 +++++++++++++++++++
 1 file changed, 50 insertions(+)
 create mode 100644 "JHLEE325/202507/28 BOJ G4 \352\260\200\354\236\245 \352\270\264 \353\260\224\354\235\264\355\206\240\353\213\211 \353\266\200\353\266\204 \354\210\230\354\227\264.md"

diff --git "a/JHLEE325/202507/28 BOJ G4 \352\260\200\354\236\245 \352\270\264 \353\260\224\354\235\264\355\206\240\353\213\211 \353\266\200\353\266\204 \354\210\230\354\227\264.md" "b/JHLEE325/202507/28 BOJ G4 \352\260\200\354\236\245 \352\270\264 \353\260\224\354\235\264\355\206\240\353\213\211 \353\266\200\353\266\204 \354\210\230\354\227\264.md"
new file mode 100644
index 00000000..5d586f54
--- /dev/null
+++ "b/JHLEE325/202507/28 BOJ G4 \352\260\200\354\236\245 \352\270\264 \353\260\224\354\235\264\355\206\240\353\213\211 \353\266\200\353\266\204 \354\210\230\354\227\264.md"	
@@ -0,0 +1,50 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+
+        int n = Integer.parseInt(br.readLine());
+
+        int[] arr = new int[n];
+        int[] dp1 = new int[n];
+        int[] dp2 = new int[n];
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        for (int i = 0; i < n; i++) {
+            dp1[i] = 1;
+            for (int j = 0; j < i; j++) {
+                if (arr[j] < arr[i]) {
+                    dp1[i] = Math.max(dp1[i], dp1[j] + 1);
+                }
+            }
+        }
+
+        for (int i = n - 1; i >= 0; i--) {
+            dp2[i] = 1;
+            for (int j = n - 1; j >= i; j--) {
+                if (arr[j] < arr[i]) {
+                    dp2[i] = Math.max(dp2[i], dp2[j] + 1);
+                }
+            }
+        }
+
+        int result = 0;
+
+        for (int i = 0; i < n; i++) {
+            result = Math.max(result, dp1[i] + dp2[i] - 1);
+        }
+
+        System.out.println(result);
+    }
+}
+
+```