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
seronic:
20240208 15:47:30
note that the output must be displayed in new line, so remember to use cout<<endl; after each iteration. 

agent17:
20240111 17:12:20
A Unique Binary search problem just u have to figure out the low and high values.....it could be solved in O(NlogN) time and O(1) space complexity. 

ashish4k:
20231117 05:28:59
I have done it in other platform this one is the worst 

mradul_2212:
20231013 14:07:43
maybe you haven't selected the language in which you're writing your code...just check once 

code_3r:
20230911 06:55:01
anyone gives some cornercase!


priyanshu_002:
20230905 20:09:27
https://www.spoj.com/users/chiragchhabria Have same Trouble did you find the solution for compilation error.


ansar:
20230823 22:00:37
@suresh_9 use scanf for getting the values 

suresh_9:
20230810 08:43:53
Can any one help me I have submitted the code in codingninja it got accepted but when i submitted the same here it was getting wrong ans........... 

adithyavarma9:
20230713 13:32:05
@datxaban any way max (min distance) = 3 

tarunvyshnav90:
20230708 17:27:46
wowwwwwwwwwww 
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 