当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2597:Line Segment Erase

题目描述
Bob has drawn some line segments on the x-axis. But he is unsatisfied with his work, because some line segments overlap with others. So he decides to erase some of them so that none of them overlaps with others. Of course, Bob only wants to erase the minimum number of line segments. Clever Bob quickly finds a method to do this, but now he wants to know how many different choices he has to remove the overlapping?
输入解释
The input contains multiple test cases. For each test case, it consists of M + 1 lines:
Line 1: a single positive integer M (M <= 80), indicating the number of line segments Bob has drawn.
Line 2 to M +1: each contains two different integers S, E (-10000 <= S, E <=10000), indicating the two end positions of a line segment.
输出解释
Output the number of sticks Bob will erase and the number of different choices in a single line, separated by a single space.
输入样例
5
1 3
3 5
4 6
8 9
4 6
1
1 3
输出样例
2 3
0 1

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2597

最后修改于 2020-10-29T06:36:42+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536