From f04b66ee5ab9eaf40ead135191f3324ddb875c1d Mon Sep 17 00:00:00 2001
From: sukangpunch <popora99@naver.com>
Date: Fri, 23 Jan 2026 13:58:54 +0900
Subject: [PATCH] =?UTF-8?q?[Week03]=20BOJ:=20=ED=9C=B4=EA=B2=8C=EC=86=8C?=
 =?UTF-8?q?=20=EC=84=B8=EC=9A=B0=EA=B8=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sukangpunch.java"                         | 67 +++++++++++++++++++
 1 file changed, 67 insertions(+)
 create mode 100644 "weekly/week03/BOJ_1477_\355\234\264\352\262\214\354\206\214\354\204\270\354\232\260\352\270\260/sukangpunch.java"

diff --git "a/weekly/week03/BOJ_1477_\355\234\264\352\262\214\354\206\214\354\204\270\354\232\260\352\270\260/sukangpunch.java" "b/weekly/week03/BOJ_1477_\355\234\264\352\262\214\354\206\214\354\204\270\354\232\260\352\270\260/sukangpunch.java"
new file mode 100644
index 0000000..c884193
--- /dev/null
+++ "b/weekly/week03/BOJ_1477_\355\234\264\352\262\214\354\206\214\354\204\270\354\232\260\352\270\260/sukangpunch.java"
@@ -0,0 +1,67 @@
+package stduy.week03;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+
+// 휴게소 세우기
+public class BOJ_1477 {
+
+    static int N;
+    static int M;
+    static int len;
+
+    static int [] rests;
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        String []s = br.readLine().split(" ");
+
+        N = Integer.parseInt(s[0]);
+        M = Integer.parseInt(s[1]);
+        len = Integer.parseInt(s[2]);
+
+        s = br.readLine().split(" ");
+        rests = new int[N+2];
+        rests[0] = len;
+        for(int i=1; i<=N; i++){
+            rests[i] = Integer.parseInt(s[i-1]);
+        }
+
+        Arrays.sort(rests);
+
+        int best = findBest();
+        System.out.println(best);
+    }
+
+    private static int findBest() {
+        int st = 1;
+        int en = len-1;
+
+        int mid = 0;
+        int ret = 0;
+        while(st <= en){
+            mid = (st+en)/2;
+            if(check(mid)){
+                st = mid+1;
+            }else{
+                ret = mid;
+                en = mid-1;
+            }
+        }
+        return ret;
+    }
+
+    private static boolean check(int mid) {
+        int cnt = 0;
+        for(int i=1; i<rests.length; i++){
+            int dist = rests[i] - rests[i-1];
+            cnt += dist/mid;
+            if(dist % mid == 0){
+                cnt--;
+            }
+        }
+        return cnt > M;
+    }
+}