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.
Phew!! Topcoder tutorial wasn't easy to understand...
awesome ques on binary search implementation .....learnt a lot !! binary search with optimizations and technique ;-) topcoder tutorial gave a new vision of this :-) AC :-)
@krototye: ATQ, C can't be less than two so your test case is not possible
1000 000 000, but it's not important.Last edit: 2016-05-19 16:07:48
can anybody tell output for case
ac .....was stuck b4, but topcoder tutorial really roks!!!! :)
int is sufficient in c++
Nice problem to learn how binary search can be applied.
Great problem.....AC in first pass
If you have no idea how to use binary search for this problem don’t waste your time trying to figure it out on your own.