Merge pull request #1589 from AlgorithmWithGod/JHLEE325

[20251205] BOJ / G5 / 연속합 2 / 이준희

Author: ShinHeeEul

JHLEE325/202512/05 BOJ G5 연속합 2.md

@@ -0,0 +1,39 @@
+```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[] left = new int[N];
+        int[] right = new int[N];
+
+        left[0] = arr[0];
+        int answer = arr[0];
+
+        for (int i = 1; i < N; i++) {
+            left[i] = Math.max(left[i - 1] + arr[i], arr[i]);
+            answer = Math.max(answer, left[i]);
+        }
+
+        right[N - 1] = arr[N - 1];
+        for (int i = N - 2; i >= 0; i--) {
+            right[i] = Math.max(right[i + 1] + arr[i], arr[i]);
+        }
+
+        for (int i = 1; i < N - 1; i++) {
+            answer = Math.max(answer, left[i - 1] + right[i + 1]);
+        }
+
+        System.out.println(answer);
+    }
+}
+```