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.
nyc qs on binary search! must do!
AC in one go.!!
can someonne highlight my error , it's a wrong answer while the output is 3
Those who are not getting it, check the first question solved in this video, from 5:10. : https://youtu.be/TC6snf6KPdELast edit: 2019-06-25 07:32:01
is it ncecessary that we have to implement it only under the tag under which the ques is categorised..that is DP??
use basic knowledge of Binary search and sorting..AC in one go
use binary search to find the answer
quora explaination ( https://qr.ae/TWIaVc ) was way too better than topcoder tutorial. One of the very good questions of binary search that I have seen. If anyone gets similar question, please comment here .
AC in one go..easy implementation of binary search