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.
AC in 12th go!!
good problem , 100th on spoj
topcoder is awesome :)
This was one of the finest problems I had come across on spoj. It gave me more insights for binary search, topcoder and quora helped a lot.
@shobit1998, It works with high=mid-1 too. Maybe there is some fault in your implementation.
in else part of binary search why does high = mid and high = mid-1 make a difference in answer
Last edit: 2018-02-28 19:52:33
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.
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!