Description: Interval intersection problem of a given x-axis n-closed interval. Remove the closed interval of as little as possible, so that the rest do not intersect the closed interval. Given by the input data file input.txt. The first line is a positive integer n, that the number of closed interval. N the next line, each line has two integers, respectively, the number of closed-end interval 2.
To Search:
File list (Check if you may need any files):
interzone.cpp
interzone.ppt
Download