# 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;
}

• 本文已收录于以下专栏：

## [leetcode-56]Merge Intervals(java)

• zdavb
• 2015年08月03日 10:28
• 886

## Merge Intervals -- LeetCode

• linhuanmars
• 2014年03月23日 08:16
• 11736

## LeetCode 56:Merge Intervals

Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8...
• sunao2002002
• 2015年06月02日 21:17
• 1770

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

Merge Intervals  Given a collection of intervals, merge all overlapping intervals. For example...
• xygy8860
• 2015年07月15日 14:06
• 1422

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

1 解题思想题目给了一堆区间[起始位置，结束位置] 这些区间可能会有一些交叠的地方（边界相邻不算），现在要求找到一个方法，可以做最少的删除动作，使得剩下的区间都不交叉覆盖，返回那个需要删除的最少次数...
• MebiuW
• 2016年11月06日 14:48
• 1862

## leecode 解题总结：352. Data Stream as Disjoint Intervals

#include #include #include #include #include #include using namespace std; /* 问题: Given a data...
• qingyuanluofeng
• 2017年03月02日 11:15
• 203

## [leetcode] 352. Data Stream as Disjoint Intervals 解题报告

• qq508618087
• 2016年06月01日 07:24
• 4653

## LeetCode --- 56. Merge Intervals

• makuiyu
• 2015年03月14日 23:03
• 1153

## POJ1716-Integer Intervals

• lyy289065406
• 2011年07月31日 17:56
• 3775

## POJ 1201 Intervals(差分约束)

POJ 1201 Intervals(差分约束) http://poj.org/problem?id=1201 题意:有n个如下形式的条件: ai bi ci,表示在区间[ai, bi]内至少要...
• u013480600
• 2014年07月18日 10:17
• 945

举报原因： 您举报文章：Intervals 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)