diff --git "a/LiiNi-coder/202507/13 BOJ \354\227\260\354\206\215\355\225\251 2.md" "b/LiiNi-coder/202507/13 BOJ \354\227\260\354\206\215\355\225\251 2.md"
new file mode 100644
index 00000000..506aa783
--- /dev/null
+++ "b/LiiNi-coder/202507/13 BOJ \354\227\260\354\206\215\355\225\251 2.md"	
@@ -0,0 +1,36 @@
+```java
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+
+public class B13398 {
+
+	private static BufferedReader br;
+	private static int n;
+	private static int[] arr;
+	private static int[][] dp;
+
+	public static void main(String[] args) throws IOException {
+		br = new BufferedReader(new InputStreamReader(System.in));
+		n = Integer.parseInt(br.readLine());
+		arr = new int[n];Q
+		String[] temp = br.readLine().split(" ");
+		for(int i = 0; i< n; i++)
+			arr[i] = Integer.parseInt(temp[i]);
+		
+		//dp 설정
+		dp = new int[n+1][2];
+		int answer = -1000;
+		answer = dp[0][0] = dp[0][1] = arr[0];
+		for(int i = 1; i< n; i++) {
+			dp[i][0] = Math.max(dp[i-1][0] + arr[i], arr[i]);
+			dp[i][1] = Math.max(dp[i-1][0],dp[i-1][1] + arr[i]);
+			answer = Math.max(answer, Math.max(dp[i][0], dp[i][1]));
+		}
+		
+		System.out.println(answer);
+	}
+
+}
+```