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
Explanation
FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.
hide comments
|
thirupathireddy:
2015-09-18 10:57:03
good one on binary search............. |
|
Sriharshaa Sammeta:
2015-09-10 19:31:43
Though it would be good if you figure out for yourself....still....
|
|
Aayush:
2015-09-04 11:54:46
this question taught me a new lesson..
|
|
satya_jha123:
2015-09-01 22:12:04
i got wa for using int and ac ,just replaced all int with long but an awesome problem |
|
Vicky:
2015-08-14 16:22:36
@sanyam jain can u provide me a topcoder link whrere u found tutorials |
|
SANYAM JAIN:
2015-08-11 20:26:24
Tutorial on topcoder is really wonderful. :)
|
|
Parikshit:
2015-08-05 07:28:29
thanx topcoder ;) |
|
Saksham :
2015-08-04 01:22:25
Yeah topcoder rocks!!
|
|
Sumit Paroothi:
2015-08-03 20:25:20
awesome question ..if ever there was one!!! |
|
Vikrant Singh:
2015-08-02 22:27:10
Too tough ! |
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 |