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?
t – the number of test cases, then t test cases follows.
* Line 1: Two space-separated integers: N and C
* Lines 2..N+1: Line i+1 contains an integer stall location, xi
For each test case output one integer: the largest minimum distance.
1 5 3 1 2 8 4 9
FJ can put his 3 cows in the stalls at positions 1, 4 and 8,
resulting in a minimum distance of 3.
is it compulsory to assign a cow the first stall
If you are wondering why 1,4,8 instead of 1,4,9 then do not. For me its actually a subtle hint for applying binary search. You will understand it when you apply the algo.
<p>int-> long got accepted .</p>
Last edit: 2015-11-03 17:32:51
Nice question,,just think whether a particular distance can be used as a minimum largest distance or not..
learned a lot from this ...!! a must do problem for beginners!!
Last edit: 2015-10-21 17:52:43
Please someone explain me how to do this problem as topcoder website is not working .
good one on binary search.............