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.
this is a nice question for implementation of binary search !
why not choose 1,4,9
Finally AC after 6 WA.
good problem...if you dont able to come up with the approach just read some tutorial or watch some explaination videos instead just jump onto the actual solution.
tf does this question mean?
Guys , for those who think for largest minimum distance , it should be 1,4,9 , not 1,4,8. Actually , it does not make any difference, because , minimum dist between two cows is (4-1) = 3 , not (9-5) = 4 , 4 is not the minimum distance, so we have to output the largest minimum distance we could get , like (1-2), (4-1), we could place cow at 1,8,9 , (8-1) = 7, but then , minimum distance would be (9-8) = 1 , I hope you understand , because the wordings are very confusing and I was stuck for a long time !! hope this helps !!
AC in one go::)
For everyone that is stuck/not able to think of the logic, check out the TopCoder tutorial for Binary Search [discrete binary search] .
You should think of doing binary search on difference.
nice question on binary search and gready approch takes time to come up the right solution.