Line coverage of the known one-dimensional space N be line segments. In accordance with the endpoint of each segment Ai and Bi (Ai <Bi, i = 1,2 ... N) defined. Integer endpoint coordinates. Some segments may intersect. Programming to delete at least the number of line segments, making the remaining two segments of arbitrary disjoint. And output the remaining segment number and the specific segment.

Packet : 21840255fugai.rar filelist
fugai.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．