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.
in 1st go.
why 1 4 9 is not the answer of given example??
Don't see any kind of solution.
Good problem ..Must for beginners...
Great one, If you know what is binary search but you aren't able to crack the trick.
AC in one go : )
One of the best problems I've ever seen. If you don't get the it, just read Topcoder tutorial carefully.
why 1,4,9 is not in answer , largest minimum distance will be 4 n this case
very good problem,lot to learn for beginners#binary search