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
abitnav:
20190928 15:29:56
Last edit: 20190928 15:34:15 

jpgmoreira:
20190912 00:27:11
Really good question about binary search. 

kb2201:
20190902 17:08:23
great ques but poorly worded 

arpitjp:
20190825 12:10:34
My code working on my computer but showing wrong answer in SPOJ


abeshek_2000:
20190817 10:58:01
great question on binary search!! 

garry_555:
20190728 08:20:42
nyc qs on binary search! must do! 

anshika_85:
20190704 12:48:43
AC in one go.!! 

dbzadnen:
20190630 17:15:45
can someonne highlight my error , it's a wrong answer while the output is 3


anshuman1117:
20190625 07:30:56
Those who are not getting it, check the first question solved in this video, from 5:10. : https://youtu.be/TC6snf6KPdE Last edit: 20190625 07:32:01 

alok_0366:
20190616 10:27:28
is it ncecessary that we have to implement it only under the tag under which the ques is categorised..that is DP?? 
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 