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
garrykevin:
20180109 13:10:51
For those who are wondering about , why the cows should be placed in positions 1 4 8. Why couldnt it be 1 4 9 since it indicates largest distance as possible.


kkarthikeyan98:
20180108 17:29:49
In the example test case, why the cows should be placed in positions 1 4 8. Why couldnt it be 1 4 9 since it indicates largest distance as possible. Please help! 

anup2raj:
20180104 09:00:11
good one Last edit: 20180104 09:01:21 

code0monkey1:
20171227 10:05:52
Struggled with it for almost A FULL MONTH ( On and Off ). Did many similar problems to get a hang of the logic before approaching the question again ( Read the topcoder binary search tutorial ).


true_idiot:
20171220 14:16:02
took 2 whole days for me to come up with the solution!


v_pp_27:
20171203 19:40:13
Topcoder tutorial on binary search helped 

Radha Krishna:
20171124 13:52:50
any similar kind of problems available out there to get the practice?


Shubham Aggarwal:
20171120 22:18:05
I tested it on a lot of cases, it runs fine, but here I'm getting NZEC in python


balakrishna21:
20171119 06:43:57
could any one give any some more test cases for this "AGGRCOW  Aggressive cows


themast3r:
20171101 16:59:04
Possibly the finest problem I solved on SPOJ. Last edit: 20171101 16:59:18 
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 