[20251112] BOJ / G4 / 좋다 / 구간 나누기 2

Author: Ukj0ng

Ukj0ng/202511/12 BOJ G4 구간 나누기 2.md

@@ -0,0 +1,79 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static int[] arr;
+    private static int N, M, max, min;
+    public static void main(String[] args) throws IOException {
+        init();
+        int answer = binarySearch();
+
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        max = 0;
+        min = 10001;
+
+        arr = new int[N];
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+            max = Math.max(max, arr[i]);
+            min = Math.min(min, arr[i]);
+        }
+    }
+
+    private static int binarySearch() {
+        int left = 0;
+        int right = max-min;
+        int result = right;
+
+        while (left <= right) {
+            int mid = left + (right - left)/2;
+
+            if (valid(mid)) {
+                result = mid;
+                right = mid-1;
+            } else {
+                left = mid+1;
+            }
+        }
+
+        return result;
+    }
+
+    private static boolean valid(int target) {
+        int index = 0;
+        int count = 1;
+        int max = 0;
+        int min = 10001;
+
+        while (index < N) {
+            max = Math.max(max, arr[index]);
+            min = Math.min(min, arr[index]);
+
+            if (max-min > target) {
+                count++;
+                max = 0;
+                min = 10001;
+                index--;
+            }
+
+            index++;
+        }
+
+        return count <= M;
+    }
+}
+```