Intervals
| Time Limit: 1000MS |
|
Memory Limit: 10000K |
| Total Submissions: 7214 |
|
Accepted: 2862 |
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
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
5
5 6
1 4
10 10
6 9
8 10
Sample Output
1 4
5 10
#include<stdio.h> #include<string.h> #include<stdlib.h> #define N 50005 struct node { int c,d; }f[N]; int cmp(const void*a,const void*b) { if((*(struct node*)a).c==(*(struct node*)b).c) //从区间左端从小到大排序 return (*(struct node*)a).d>(*(struct node*)b).d?1:-1; //如果左端相等按右段排序 return (*(struct node*)a).c>(*(struct node*)b).c?1:-1; } int main() { int n,i; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d%d",&f[i].c,&f[i].d); qsort(f,n,sizeof(f[0]),cmp); int a=f[0].c,b=f[0].d; for(i=1;i<n;i++) { if(f[i].c>b) //若区间不交叉，输出上一个区间 { printf("%d %d
",a,b); a=f[i].c; b=f[i].d; } else if(b<f[i].d) b=f[i].d; //否则，判断当前右端是否大于上一区间的右端 } printf("%d %d
",a,b); } return 0; }