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.
use this testcase:
@kishor_e it is also true choosing 1,4,9 but the answer will remain same.
AC 0.04 in on go!!
Those who got AC, kindly check this test case...
AC in 0.03 seconds.
AC 0.08!!! You need to binary search minimal distance between cows and after that check it out! Easy :)
Great Question to feel and fell for BS (Binary Search) xD
why not choose 1,4,9?
Really good problem on Binary search . This basically involves the concept of binary search on answer where we decide which side will give better answer(left or right if some condition satisfies) after finding the mid. Watch video on Binary search by ERRICHTO he has explained the concept really well using the largest >=x problem in his video.
AC in 0.07 sec !!