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 spaceseparated 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
Output details:
FJ can put his 3 cows in the stalls at positions 1, 4 and 8,
resulting in
a minimum distance of 3.
hide comments
aniketakgec:
20201226 10:27:37
The largest minimum distance means ====> there are a lot of distances which you can maintain between the cows while placing them in the barn. In this problem, you just have to find the maximum among those possible distances.


codex666:
20201218 20:16:58
I have a solution but I am getting WA. It is a combination of binary search and priority queue. Does anyone have a list of tricky testcases?


aakash18:
20201209 09:05:19
One hell of a question that was. Wow !!! Really nice question on binary search. Tried it for 2 days.


abhisek_905:
20201129 05:10:49
for reference see https://www.geeksforgeeks.org/placekelementssuchthatminimumdistanceismaximized/ Last edit: 20201129 05:13:10 

satyam_656:
20201127 06:18:05
good question of binary search for beginners 

fadihamwi2001:
20201126 11:53:49
got an AC :)


shashankchdhry:
20201110 10:40:48
Guys, those of you who are finding it overwhelming or unsolvable I want to say take a break and do it again. No matter how long of a break you need, sometimes a fresh perspective comes with time. I tried this question 6 months ago, that time I even wasn't able to understand the discrete binary search approach. After a few days, I understood the concept then coded it, but the code didn't work. I gave up that time feeling overwhelmed. Now today, after 6 months I tried again. This time I got it! :D


tomatoispotato:
20201030 14:10:14
What does "largest minimum" distance even means? Isn't largest and minimum conflicting? 

aceash:
20201020 09:03:52
binary search on answers :) 

okpreetam:
20201011 07:47:33
Those who got AC, kindly check this test case...

Added by:  Roman Sol 
Date:  20050216 
Time limit:  2s 
Source limit:  10000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  USACO February 2005 Gold Division 