From 1bcd6a272b4ea2df043c33fa27ef6a32bb3d2e89 Mon Sep 17 00:00:00 2001 From: zinnnn37 Date: Sun, 8 Feb 2026 23:16:49 +0900 Subject: [PATCH] =?UTF-8?q?[20260208]=20BOJ=20/=20G4=20/=20=ED=9C=B4?= =?UTF-8?q?=EA=B2=8C=EC=86=8C=20=EC=84=A4=EC=B9=98=20/=20=EA=B9=80?= =?UTF-8?q?=EB=AF=BC=EC=A7=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...4\354\206\214 \354\204\244\354\271\230.md" | 61 +++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 "zinnnn37/202602/8 BOJ G4 \355\234\264\352\262\214\354\206\214 \354\204\244\354\271\230.md" diff --git "a/zinnnn37/202602/8 BOJ G4 \355\234\264\352\262\214\354\206\214 \354\204\244\354\271\230.md" "b/zinnnn37/202602/8 BOJ G4 \355\234\264\352\262\214\354\206\214 \354\204\244\354\271\230.md" new file mode 100644 index 00000000..52d67c82 --- /dev/null +++ "b/zinnnn37/202602/8 BOJ G4 \355\234\264\352\262\214\354\206\214 \354\204\244\354\271\230.md" @@ -0,0 +1,61 @@ +```java +import java.io.*; +import java.util.Arrays; +import java.util.StringTokenizer; + +public class BJ_1477_휴게소_세우기 { + + private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); + private static StringTokenizer st; + + private static int N, M, L; + private static int[] rests; + + public static void main(String[] args) throws IOException { + init(); + sol(); + } + + private static void init() throws IOException { + st = new StringTokenizer(br.readLine()); + N = Integer.parseInt(st.nextToken()); + M = Integer.parseInt(st.nextToken()); + L = Integer.parseInt(st.nextToken()); + + rests = new int[N + 2]; + st = new StringTokenizer(br.readLine()); + for (int i = 1; i <= N; i++) { + rests[i] = Integer.parseInt(st.nextToken()); + } + rests[N + 1] = L; + Arrays.sort(rests); + } + + private static void sol() throws IOException { + int left = 1; + int right = L - 1; + + while (left <= right) { + int mid = left + (right - left) / 2; + + int sum = 0; + for (int i = 1; i <= N + 1; i++) { + sum += (rests[i] - rests[i - 1] - 1) / mid; + } + + if (sum > M) { + left = mid + 1; + } else { + right = mid - 1; + } + } + + bw.write(left + ""); + bw.flush(); + bw.close(); + br.close(); + } + +} +``` \ No newline at end of file