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
|
jpgmoreira:
2019-09-12 00:27:11
Really good question about binary search. |
|
kb2201:
2019-09-02 17:08:23
great ques but poorly worded |
|
abeshek_2000:
2019-08-17 10:58:01
great question on binary search!! |
|
garry_555:
2019-07-28 08:20:42
nyc qs on binary search! must do! |
|
anshuman1117:
2019-06-25 07:30:56
Those who are not getting it, check the first question solved in this video, from 5:10. : https://youtu.be/TC6snf6KPdE Last edit: 2019-06-25 07:32:01 |
|
alok_0366:
2019-06-16 10:27:28
is it ncecessary that we have to implement it only under the tag under which the ques is categorised..that is DP?? |
|
phuongbo_255:
2019-05-10 17:30:00
use binary search to find the answer |
|
harshraj22aug:
2019-05-07 23:30:43
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 . |
|
aujasvit_datta:
2019-03-06 05:40:38
Can't it be 1,4,9 instead of 1,4,8 |
|
aj_254:
2019-02-24 12:45:19
should i try in python or leave it?
|
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 |