运用vector解决区间合并问题

解题思路:

注意事项:将就着看吧这个格式调不好

参考代码:

#include<iostream>

#include<vector>

#include<algorithm>

using namespace std;

typedef pair<int,int>PII;

const int N = 100010;

int n;

vector<PII>segs;

void merge(vector<PII>& segs)

{

vector<PII> res;

sort(segs.begin(), segs.end());

int st = -2e9,ed=-2e9;

for (auto seg : segs)

{

if (ed < seg.first)

{

if (st != -2e9)

res.push_back({ st,ed });

st = seg.first,ed = seg.second;

}

else

ed = max(ed, seg.second);

}if (st != -2e9)res.push_back({ st, ed });

segs = res;

}

int main()

{

cin >> n;

for (int i = 0; i < n; i++)

{

int l, r;

cin >> l >> r;

segs.push_back({ l,r });

}

merge(segs);

if (segs.size() == 1)

cout << segs[0].first << " " << segs[0].second;

else

cout << "no";

}