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.
Not an easy problem don't worry if you get stuck
I made it ;) never thought of this
@shubh3082 does it matter weather it is 8 or 9
according to the problem we have to maximize the distance between the cows.
Quite an easy problem i don't know why people make so fuss about it.
Poorly worded, although a good problem.
If your code is completely correct in your compiler still getting error in this complier, watch : https://youtu.be/BrhLrMeU5JA
The God Question of Binary Search, if you are stuck or getting error. watch both part of this video
this problem was fun!!
@kimg but questions says "minimum distance between any two of them is as large as possible." so we have to maximise minimum distance. which can come at 5 if put at 9