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
chiragchhabria:
20221025 12:22:06
i have solved the problem in IDE but unable to submit it due to compilation error can someone help 

codertoon:
20221018 07:28:35
@kissu007  your first True in predicate is smallest minimum distance. 

killers_k9:
20221016 15:39:35
Nice question based on Binary search !! still thinking lol :( 

mars_coder:
20221009 18:15:51
an educational problem in binary search category :) Last edit: 20221009 18:18:40 

kissu007:
20211204 19:39:46
Could anybody let me know what if we have to look for smallest minimum distance? 

mohit_010:
20211111 12:18:51
I suck Last edit: 20211112 03:13:33 

geek_abhi:
20210913 06:26:57
Why we are always picking the first position in sorted array? Last edit: 20210913 06:27:18 

abhiyadav:
20210823 19:23:42
@shubh3082 no we have to maximize the minimum distance possible!! 

adi123cm:
20210713 09:51:22
Not an easy problem don't worry if you get stuck


akshat047:
20210629 18:41:12
I made it ;) never thought of this 
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 