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.



5 3



Output details:

FJ can put his 3 cows in the stalls at positions 1, 4 and 8,
resulting in a minimum distance of 3.

hide comments
Krzysztof Strojny: 2015-07-09 20:58:31

Can someone please look at my solution? I have no clue why it's not working (edit: forgot to delete package name, silly mistake)

Last edit: 2015-07-13 22:40:21
pbd: 2015-07-04 20:17:00

All hail topcoder.

Shashank kumar: 2015-06-29 15:18:48

you have to find the largest possible distance not minimum possible distance got two wrong answers for that .
And yeah ! one more thing when required no . of cows exceeds the given number or is equal that is good you just have to increase the mid value but when it is less than given number then decrease it .

Rishabh: 2015-06-26 15:59:51

Super Concept <3

sumit2893: 2015-06-17 16:54:19

Here read it ..
Dont miss the example he explains .

jokysatria: 2015-06-15 02:09:10

someone can help me? can you explain to me, what is the relation of binary search with this problem? give me the clue. thx

Last edit: 2015-06-15 02:51:38
Maverick: 2015-06-03 17:55:35

Great Problem.Now i Know where and why to use Binary Search.

sharif ullah: 2015-06-03 08:28:52

ohh! 1,4,8 ans will be 3

Last edit: 2015-06-03 08:31:13
[Mayank Pratap]: 2015-05-28 17:41:32

Phew.....ACed ....
If u read topcoder tutorials 10 times ......u definitely get something.... :)

shuvadip: 2015-03-21 18:04:38

Sorry silly mistake!!!!

Last edit: 2015-03-30 19:20:16

Added by:Roman Sol
Time limit:2s
Source limit:10000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:USACO February 2005 Gold Division