title: How to find minimum L such that k given segments with length L could cover n given points?
body: <p><em>There are n points on the x-axis, each with an integer coordinate in the range [0, n^3
  ]. We can cover these points with k segments, each of length L (a segment can cover all the points within it, including the endpoints). <strong>Given k and n, how to find the minimum L in O(nlogn) time?</strong></em></p>
  <p>I've thought that <strong>if n&lt;=k, then L -&gt;0</strong>, but when n&gt;k, things start to be complicated, hope you could help me out.</p>