[권혁준-19주차 알고리즘 스터디]

권혁준_19주차/[BOJ-1508] 레이스.md

@@ -0,0 +1,86 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main {
+
+    // IO field
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static StringTokenizer st = new StringTokenizer("");
+
+    static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+    static String nextToken() throws Exception {
+        while(!st.hasMoreTokens()) nextLine();
+        return st.nextToken();
+    }
+    static int nextInt() throws Exception { return Integer.parseInt(nextToken()); }
+    static long nextLong() throws Exception { return Long.parseLong(nextToken()); }
+    static double nextDouble() throws Exception { return Double.parseDouble(nextToken()); }
+    static void bwEnd() throws Exception {bw.flush();bw.close();}
+
+    // Additional field
+
+    static int N, M, K;
+    static int[] A;
+
+    public static void main(String[] args) throws Exception {
+
+        ready();
+        solve();
+
+        bwEnd();
+
+    }
+
+    static void ready() throws Exception{
+
+        N = nextInt();
+        M = nextInt();
+        K = nextInt();
+        A = new int[K];
+        for(int i=0;i<K;i++) A[i] = nextInt();
+
+    }
+
+    static void solve() throws Exception {
+
+        int s = 0, e = 1000000, m = (s+e+1)>>1;
+        String answer = "";
+        while(s<e){
+            String result = check(m);
+            if(result == null) e = m-1;
+            else {
+                answer = result;
+                s = m;
+            }
+            m = (s+e+1)>>1;
+        }
+        bw.write(answer);
+
+    }
+
+    static String check(int dist) {
+
+        for(int st=0;st<=K-M;st++){
+            String res = "1";
+            int last = A[st], cnt = 1;
+            for(int i=st+1;i<K;i++){
+                if(A[i] - last < dist) res += '0';
+                else {
+                    if(cnt < M){
+                        res += '1';
+                        last = A[i];
+                        cnt++;
+                    }
+                    else res += '0';
+                }
+            }
+            if(cnt == M) return res;
+        }
+        return null;
+
+    }
+
+}
+```