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
laudasur:
2024-08-27 14:58:02
This platform is pretty shit. |
|
danielcolao:
2024-07-23 13:56:31
Nice problem! |
|
hassanismail:
2024-06-30 13:45:19
seronic thank you so much for clarifying the endl thing i was about to enter a never-ending rabbit hole Last edit: 2024-06-30 13:46:07 |
|
akaryan_13:
2024-05-20 12:14:38
good problem Last edit: 2024-05-20 12:19:08 |
|
s4muka:
2024-05-19 18:17:49
Very good problem! |
|
dhawalnil:
2024-04-20 14:04:00
According to my understand problem states :
|
|
priyansh_19:
2024-03-09 13:43:08
Do solve this problem: https://www.spoj.com/problems/FLT
|
|
seronic:
2024-02-08 15:47:30
note that the output must be displayed in new line, so remember to use cout<<endl; after each iteration. |
|
agent17:
2024-01-11 17:12:20
A Unique Binary search problem just u have to figure out the low and high values.....it could be solved in O(NlogN) time and O(1) space complexity. |
|
ashish4k:
2023-11-17 05:28:59
I have done it in other platform this one is the worst |
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 |