AGGRCOW - Aggressive cows
Farmer John has built a new long barn, with N (2 ≤ N ≤ 100,000) stalls. The stalls are located along a straight line at positions x1 ... xN (0 ≤ xi ≤ 1,000,000,000).
His C (2 ≤ C ≤ N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ wants to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?
Input
t – the number of test cases, then t test cases follows.
- Line 1: Two space-separated integers: N and C
- Lines 2..N+1: Line i+1 contains an integer stall location, xi
Output
For each test case output one integer: the largest minimum distance.
Example
Input: 1 5 3 1 2 8 4 9 Output: 3
Explanation
FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.
hide comments
|
sonuexpc:
2018-06-09 10:14:25
very good problem,lot to learn for beginners#binary search |
|
cookie_m0nster:
2018-05-31 13:16:43
<h1> Good problem </h1> |
|
ambasta_4698:
2018-05-30 09:20:57
a good one !! |
|
avnishtirkey:
2018-05-24 01:21:01
Is 2-4-8 valid? If yes then answer should be 2 for the given test case. |
|
Li Xiaofeng:
2018-05-22 14:40:25
I believe 1-4-9 is also a valid arrangement, minimum distance is still 3. |
|
anirudnits:
2018-05-22 07:39:21
brilliant question! |
|
vikicoder:
2018-05-11 22:08:01
I got Runtime Error on submitting. I referred many other's solutions but still I am not able to find the error in my code. Below is the link of my code. Can someone please help me with it?
|
|
kapilgm:
2018-03-27 08:49:43
AC in 12th go!!
|
|
yaswanth desu:
2018-03-21 15:19:32
Hello Everyone,
|
|
amitboss:
2018-03-16 18:54:10
good problem , 100th on spoj |
Added by: | Roman Sol |
Date: | 2005-02-16 |
Time limit: | 2s |
Source limit: | 10000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | USACO February 2005 Gold Division |