[20251205] BOJ / G5 / 연속합 2 / 설진영

Implement solution for BOJ G5 Continuous Sum 2 problem.

Author: Seol-JY

Seol-JY/202512/05 BOJ G5 연속합 2.md

@@ -0,0 +1,32 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int n = Integer.parseInt(br.readLine());
+        int[] arr = new int[n];
+        
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+        
+        int dp0 = arr[0];
+        int dp1 = Integer.MIN_VALUE / 2;
+        
+        int answer = dp0;
+        
+        for (int i = 1; i < n; i++) {
+            dp1 = Math.max(dp1 + arr[i], dp0);
+            dp0 = Math.max(dp0 + arr[i], arr[i]);
+            
+            answer = Math.max(answer, Math.max(dp0, dp1));
+        }
+        
+        System.out.println(answer);
+    }
+}
+
+```