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?
Input
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
Output
For each test case output one integer: the largest minimum distance.
Example
Input:
1 5 3 1 2 8 4 9
Output:
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
krototype:
2016-05-18 17:29:16
can anybody tell output for case
|
|
vickyyo:
2016-05-16 23:06:42
ac .....was stuck b4, but topcoder tutorial really roks!!!! :)
|
|
Dushyant Singh:
2016-05-13 21:25:22
int is sufficient in c++ |
|
dinkar:
2016-05-04 22:20:58
Nice problem to learn how binary search can be applied. |
|
atif_11:
2016-05-04 20:56:25
Great problem.....AC in first pass |
|
vstepano:
2016-05-04 18:23:24
If you have no idea how to use binary search for this problem don’t waste your time trying to figure it out on your own.
|
|
piuspbd:
2016-04-17 12:22:14
Do we must sort those stalls? I used bubble sort and got WA, then qsort and got AC.. |
|
sy_117:
2016-04-01 21:23:29
finally finally Done !!!! Great ques on Binary search .Topcoder tutorials rocks :P
|
|
karthik1997:
2016-04-01 15:24:45
1. Use Long int
|
|
swapnil18:
2016-04-01 10:53:50
Please give the link to the Topcoder tutorial |
Added by: | Roman Sol |
Date: | 2005-02-16 |
Time limit: | 2s |
Source limit: | 10000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | USACO February 2005 Gold Division |