Intervals

Problem 60: Intervals

Time Limit:1 Ms| Memory Limit:10 MB
Difficulty:0

Description

There is given the series of n closed intervals [ai; b i], where i=1,2,...,n. The sum of those intervals may berepresented 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.
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.

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>
#include <iostream>
#include <algorithm>

using namespace std;

typedef struct Elem
{
int start;
int end;
}elem;

elem temp[50001];

bool cmp(elem a, elem b)
{
if(a.start != b.start)
{
return a.start < b.start;
}
else
{
return a.end < b.end;
}
}

int main()
{
int n, i;
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%d%d", &temp[i].start, &temp[i].end);
}
sort(temp, temp+n, cmp);
elem t = temp[0];
for(i = 1; i < n; i++)
{
if(temp[i].start > t.end)
{
printf("%d %d\n", t.start, t.end);
t = temp[i];
}
else
{
if(temp[i].end > t.end)
{
t.end = temp[i].end;
}
}
}
printf("%d %d\n", t.start, t.end);
return 0;
}

[Python]Merge Intervals

2016-06-15 23:20:31

Leetcode 435. Non-overlapping Intervals 无交叉覆盖区间 解题报告

2016-11-06 14:48:21

[leetcode-56]Merge Intervals(java)

2015-08-03 10:28:32

POJ - 1716 Integer Intervals（差分约束系统）

2015-08-05 00:31:58

leetCode 56.Merge Intervals (合并区间) 解题思路和方法

2015-07-15 14:06:02

【LeetCode】Merge Intervals 解题报告

2015-04-06 20:32:50

ZOJ-3953-Intervals【贪心】【17th浙大校赛】

2017-04-10 12:22:17

LeetCode 56 Merge Intervals（Python实现及详解）

2017-08-01 11:27:49

435. Non-overlapping Intervals

2016-10-30 16:33:26

LeetCode 352. Data Stream as Disjoint Intervals（数据流区间）

2016-06-16 01:11:36