Description: 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.
To Search:
- [clock] - 4x4 keyboard control locks. I wrote it m
- [balanced] - Histogram is the so-called gray level in
File list (Check if you may need any files):
Download