Aggressive Cows
Medium
Binary Search on Answer
Place c cows in stalls at the given positions so that the minimum distance between any two cows is as large as possible. Print that largest minimum distance.
Constraints
2 <= c <= n <= 10^5 0 <= position <= 10^9
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.