Skip to content

[Week03] BOJ 1477: 휴게소 세우기 #33

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
JAEHEE25 merged 1 commit into from
Jan 26, 2026
Merged

[Week03] BOJ 1477: 휴게소 세우기 #33

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
43 changes: 43 additions & 0 deletions weekly/week03/BOJ_1477_휴게소세우기/JAEHEE25.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
package week03.BOJ_1477_휴게소세우기;

import java.util.*;
import java.lang.*;
import java.io.*;

class BOJ1477 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
int L = Integer.parseInt(st.nextToken());

int[] rests = new int[N + 2];
rests[0] = 0;
st = new StringTokenizer(br.readLine());
for (int i = 0; i < N; i++) {
rests[i] = Integer.parseInt(st.nextToken());
}
rests[N + 1] = L;
Arrays.sort(rests); //정렬

int left = 1;
int right = L - 1;

while (left <= right) {
int mid = (left + right) / 2;
int sum = 0;

for(int i = 1; i < rests.length; i++) {
sum += (rests[i] - rests[i-1] - 1) / mid;
}

if(sum > M) {
left = mid + 1;
} else {
right = mid - 1;
}
}
System.out.println(left);
}
}