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

建议使用的浏览器:

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

1716:Integer Intervals

题目描述
An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b.
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.
输入解释
The first line of the input contains the number of intervals n, 1 <= n <= 10000. Each of the following n lines contains two integers a, b separated by a single space, 0 <= a < b <= 10000. They are the beginning and the end of an interval.
输出解释
Output the minimal number of elements in a set containing at least two different integers from each interval.
输入样例
4
3 6
2 4
0 2
4 7
输出样例
4

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

题目来源 CEOI 1997

源链接: POJ-1716

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

共提交 0

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