From 87d50cfa0380d1a0047180980765fbdfd2632857 Mon Sep 17 00:00:00 2001
From: longrunpc <pcjmo4050@gmail.com>
Date: Tue, 14 Apr 2026 18:20:11 +0900
Subject: [PATCH] =?UTF-8?q?Solve(binary=5Fsearch):=20BOJ=2017179=20"?=
 =?UTF-8?q?=EC=BC=80=EC=9D=B4=ED=81=AC=20=EC=9E=90=EB=A5=B4=EA=B8=B0"=20?=
 =?UTF-8?q?=EB=AC=B8=EC=A0=9C=20=ED=92=80=EC=9D=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 Main.class | Bin 0 -> 2094 bytes
 Main.java  |  63 +++++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 63 insertions(+)
 create mode 100644 Main.class
 create mode 100644 Main.java

diff --git a/Main.class b/Main.class
new file mode 100644
index 0000000000000000000000000000000000000000..52d2bfccbf90e11040f0b1a7a81cb0d99924bd0d
GIT binary patch
literal 2094
zcmaJ?OLtRM6#h<f!%Z%?4_ZQ7+LTw(q|inR6l&V2EmWd?AgN$MrMJnUy)?OrH#aQm
zz!4*t183q)alnL$Wv#Z0y8Ho796It3_!C$Pe&;5AK&vY&Is2Ub`u2DBKKbp%vtI#>
zplTq1pbpJM2>S$@?^^e)WWjP4lGF2dWzG}WH*7n$mlg=d6W4Ww1rGT}b}2bpy>myp
zGJj24dFkpf1Ufc#8K+$JvYsogVoe=^i3S~wCYsRvN~Y{`#gj#Wfb9rGC-#VtG7v$F
z!q_U%9^ca>aovE9s4_Yv(7J6@OP^BU+cyDLJ-d)3I@?*8DJ@CI{!+Ti{jiBnbP0rs
zJ3nDNQs7`bQOoDEQu866Hgv00M~JwdYNuX-X~QuS$5ph5Bky~D9s@l%spAb3Zz3*m
zV4LoY<H-f-GIiN<E0Wv)h@6R_7pHWbHqnQE0d3M!yb1O7b#IwCqZFd3EYF%a=kE$?
zH)!GlE>c$^-M2D2-WF)v22rbSv}zZ4p9Y2yH0U&9B8_(h%z4|f+~usa+}t7)$1{mc
z3)|>D6QdYoprW-T$4XAl@^0APBBhFFIUZ9*X}TAQL%3{W9PhKsta4d8d4ayY*xcn?
zhnP}Ll`-)FK4gEEs*1C%=D5n+t#=^rYZ6mBrcGSMN9>Nx9@}9f5GpH=*J!Ve0lP;r
zku@=ckBK&CIb$kYD4xkAZW_3OPjt+hxQSZ=joXAyS{|7S7Oner+YEUdE9Kc&O{%@7
zs>ONf&RFvWo@hn?CJ)7L?W&jg1sbxRm0Oy$%5{6=^8K7Fdp3F2k=s#KW_n8_U}Q^G
zHz&t!l_H{=rC;IW1df(UUd3~*@}%?@OZiIEJ}erraaYHZy3&F`&vq%cbB~i!ADY@N
zk6Ssf<Sq+5+<9qr!&=ZQmXj~YO3y^8v{Wspb{Dqe<Q2!6<+9wvd?z)VSF=0Bm{llb
zZBM4c;8+9%A0{*7IMN*}Se1$-U0(>C+*R9Nkae(syZ_&m4N<EPN7*C+j)aD=node#
zHH`ksG4xjspl<>7<U-(6?qXa8*HG^o#LpB2KI5-at6&j)j@t}OQ?cK710HTbpWQ%Y
zb_M&_a9|AwCpOSFdukOOYluyrUd7RMoOp`FmXzF*23C;##dwPI!E}t`BScqlKBiph
zGW{SZ9>4r+14FZGNKFL?wWzj&#3LN58?0k^Fw_?fJ;S@eDlXl4pwZ#a6<q0C#e_m1
z@X?Q=nQ|B{#NQ1AaqPzc2X+_@xP(TIWD{n&-loL@TH)d#zCsjVQ~nn1_zoSIV}uT9
zFEFk{*U=`Pqx~NkI)*5nghjPRlIEF$ZxkiP<~IZo;yM@{4vwr~Al()F3B6shxllnB
zb9f!szDG-ER9naO;i#s~jXXw}Yd-z><sY3-=vgbEpMZfb?qbZ+%~FmK`cc9>&XW^-
z%X@H|FZmfH_{jG9V4D@#un^*JoFGIkz{2@vyoPKfI1)_PnI-*6(jV3OWBJ2BqTxY6
z)VAra&L7Z7{Qh}Jd*bu_dvF_IFN1?^6+n^z&yddn{(qe%)N>@~0;P*M&+`;NbF^$w
j;B<nEH9aRoLF9QDfW#fHVPah1w}=vV2Bk8u#6!ow{(<Ak

literal 0
HcmV?d00001

diff --git a/Main.java b/Main.java
new file mode 100644
index 0000000..8b93970
--- /dev/null
+++ b/Main.java
@@ -0,0 +1,63 @@
+import java.io.*;
+import java.util.*;
+
+class Main {
+    static int n, m, l;
+    static int[] s;
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        n = Integer.parseInt(st.nextToken());
+        m = Integer.parseInt(st.nextToken());
+        l = Integer.parseInt(st.nextToken());
+        s = new int[m];
+        for(int i = 0;i<m;i++) {
+            s[i] = Integer.parseInt(br.readLine());
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for(int i = 0;i<n;i++) {
+            int tmp = binarySearch(Integer.parseInt(br.readLine()));
+            sb.append(tmp + "\n");
+        }
+
+        System.out.print(sb);
+    }
+
+    public static int binarySearch(int q) {
+        int res = 0;
+        int left = 0;
+        int right = l;
+        while(left <= right) {
+            int mid = (left + right) / 2;
+            
+            if (canCut(mid, q)) { // 자를수 있으면
+                res = Math.max(res, mid);
+                left = mid + 1;
+            }
+            else {
+                right = mid - 1;
+            }
+        }
+        return res;
+    }
+
+    private static boolean canCut(int minLen, int q) {
+        int count = 0;
+        int last = 0; 
+
+        for (int i = 0; i < m; i++) {
+            if (s[i] - last >= minLen) {
+                count++;
+                last = s[i];
+            }
+            
+            if (count == q && (l - last) >= minLen) {
+                return true;
+            }
+        }
+        return false;
+    }
+}
+
+// 10 10 15 20 5 10
\ No newline at end of file