Merge pull request #498 from AlgorithmWithGod/LiiNi-coder

[20250718] BOJ / G4 / 구간 나누기 2 / 이인희

Author: ShinHeeEul

LiiNi-coder/202507/18 BOJ 구간 나누기 2.md

@@ -0,0 +1,59 @@
+```java
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class Main {
+	private static BufferedReader br;
+	private static int n;
+	private static int k;
+	private static int[] arr;
+
+	public static void main(String[] args) throws IOException {
+		br = new BufferedReader(new InputStreamReader(System.in));
+		var temp = br.readLine().split(" ");
+		n = Integer.parseInt(temp[0]);
+		k = Integer.parseInt(temp[1]);
+
+		arr = new int[n];
+		var st = new StringTokenizer(br.readLine());
+		for (int i = 0; i < n; i++) {
+			arr[i] = Integer.parseInt(st.nextToken());
+		}
+
+		int left = 0;
+		int right = 10000;
+		int answer = 10000;
+
+		while (left <= right) {
+			int mid = (left + right) / 2;
+			if (canDivide(mid)) {
+				answer = mid;
+				right = mid - 1;
+			} else {
+				left = mid + 1;
+			}
+		}
+
+		System.out.println(answer);
+	}
+
+	private static boolean canDivide(int maxGap) {
+		int count = 1;
+		int min = arr[0];
+		int max = arr[0];
+
+		for (int i = 1; i < n; i++) {
+			min = Math.min(min, arr[i]);
+			max = Math.max(max, arr[i]);
+			if (max - min > maxGap) {
+				count++;
+				min = arr[i];
+				max = arr[i];
+			}
+		}
+		return count <= k;
+	}
+}
+```