An Segment Coverage Problem

Revision en1, by cancaneed, 2023-04-23 12:43:24

There are $$$n$$$ points on the line, the position of $$$i$$$ th point is $$$p[i]$$$. there are Q querys. you will got a segment which length is $$$D[i]$$$, ask at least how many segments are needed to cover all points.

$$$ 1 \le n \le 10^5 $$$, $$$ 1 \le p[i] \le 10^9 $$$, $$$ 1 \le q \le 10^5 $$$

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English cancaneed 2023-04-23 12:43:24 302 Initial revision (published)