POJ1089解题报告 区间合并
来源:互联网 发布:数据库完整性管理实验 编辑:程序博客网 时间:2024/04/30 14:06
Intervals
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5345 Accepted: 2087
Description
There is given the series of n closed intervals [ai; bi], where i=1,2,...,n. The sum of those intervals may be represented as a sum of closed pairwise non−intersecting intervals. The task is to find such representation with the minimal number of intervals. The intervals of this representation should be written in the output file in acceding order. We say that the intervals [a; b] and [c; d] are in ascending order if, and only if a <= b < c <= d.
Task
Write a program which:
reads from the std input the description of the series of intervals,
computes pairwise non−intersecting intervals satisfying the conditions given above,
writes the computed intervals in ascending order into std output
Task
Write a program which:
reads from the std input the description of the series of intervals,
computes pairwise non−intersecting intervals satisfying the conditions given above,
writes the computed intervals in ascending order into std output
Input
In the first line of input there is one integer n, 3 <= n <= 50000. This is the number of intervals. In the (i+1)−st line, 1 <= i <= n, there is a description of the interval [ai; bi] in the form of two integers ai and bi separated by a single space, which are respectively the beginning and the end of the interval,1 <= ai <= bi <= 1000000.
Output
The output should contain descriptions of all computed pairwise non−intersecting intervals. In each line should be written a description of one interval. It should be composed of two integers, separated by a single space, the beginning and the end of the interval respectively. The intervals should be written into the output in ascending order.
Sample Input
55 61 410 106 98 10
Sample Output
1 45 10
题意:给定若干个子集,求并集
比较水的题,很容易想到对每个子集左区间排序,然后相邻两个集合合并。。。。细节上没太注意导致WA了一次。。。
- POJ1089解题报告 区间合并
- Intervals poj1089 解题报告
- 【合并果子】解题报告
- 合并果子解题报告
- poj1089
- 解题报告:区间求和 I
- 【贪心算法,区间覆盖】:poj1089,Intervals
- P1097合并果子解题报告
- 1063合并果子【解题报告】
- [NOIP2004] 合并果子-解题报告
- [hihoCoder] #1305 : 区间求差 解题报告
- poj 3468 区间修改查询 解题报告
- CDOJ 1321 区间DP 解题报告
- CodeVS 3657 区间DP 解题报告
- CodeVS3657 括号序列 解题报告【区间DP】
- 石子合并(动态规划)详细解题报告
- 石子合并(动态规划)详细解题报告
- 石子合并(动态规划)详细解题报告
- 中国地区三级联动下拉菜单
- cookie 和session的区别
- 点城市空气质量日报
- 中国互联网企业区域地图
- 串口通讯流控制
- POJ1089解题报告 区间合并
- POJ2876解题报告 递归
- csdn,我来了
- poj 3159 Candies
- gdb 调试-1
- poj 1273 Drainage Ditches
- 用CMake写一个简单的交叉编译测试工程
- 1740
- poj 1274 The Perfect Stall