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 one go.
first attempt AC !!! Thanks to Akash Yadav Sir and Sudama Sir
my complexity is O(c*log(max(x[i]))*logn)
Nice Problem on Binary Search : )
@lapmid, you need to find that particular positions set for cows such that minimum distance of that particular set is largest among other sets.
For those who are not able to understand the approach to solve, this may help -
Classic question, impressive way of using binary-search.
Those who are unable to solve refer to Topcoder tutorial: https://www.topcoder.com/community/competitive-programming/tutorials/binary-search and Commonlounge : https://www.commonlounge.com/discussion/a8cb881fae1946b5b689858a71e70558/37c42cbbcfa14644a94f08f69bd741d1
Finally AC :)
Very Good Problem. I didn't even knew we can implement binary search this way :)