这道题做的挺顺利的。
首先按照起点排序,一一扫描,合并后面能合并的,生成一个新区间,输出即可。
thestoryofsnow | 1089 | Accepted | 564K | 63MS | C++ | 1053B |
/*
ID: thestor1
LANG: C++
TASK: poj1089
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>
using namespace std;
class Interval {
public:
int ai, bi;
Interval() : ai(-1), bi(-1) {}
Interval(int ai, int bi) : ai(ai), bi(bi) {}
inline bool operator< (const Interval &rhs) const
{
return ai < rhs.ai || (ai == rhs.ai && bi <= rhs.bi);
}
};
int main()
{
int n;
scanf("%d", &n);
std::vector<Interval> intevals(n);
for (int i = 0; i < n; ++i)
{
scanf("%d%d", &intevals[i].ai, &intevals[i].bi);
}
sort(intevals.begin(), intevals.end());
for (int i = 0; i < intevals.size();)
{
int j = i + 1;
while (j < intevals.size() && intevals[j].ai <= intevals[i].bi)
{
intevals[i].bi = max(intevals[i].bi, intevals[j].bi);
j++;
}
printf("%d %d\n", intevals[i].ai, intevals[i].bi);
i = j;
}
return 0;
}