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.
someone can help me? can you explain to me, what is the relation of binary search with this problem? give me the clue. thxLast edit: 2015-06-15 02:51:38
Great Problem.Now i Know where and why to use Binary Search.
ohh! 1,4,8 ans will be 3Last edit: 2015-06-03 08:31:13
Sorry silly mistake!!!!Last edit: 2015-03-30 19:20:16
I'm with chilaka... I believe the farmer would have put the cows in 1,4,9. However, I don't believe that would change the answer of 3 because there would still be the minimum distance between stall 1 and stall 4 of 3.
but it is said that the largest distance between any two cows as maximum as possible!!
We have to find the largest minimum distance, not maximum distance!
why cant he put his cows in 1,4,9
Kunwar Sachin Singh: