区间合并算法

区间合并

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef pair<int, int> PII;

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()
{
    int n;
    scanf("%d", &n);

    vector<PII> segs;
    for (int i = 0; i < n; i ++ )
    {
        int l, r;
        scanf("%d%d", &l, &r);
        segs.push_back({l, r});
    }

    merge(segs);

    cout << segs.size() << endl;

    return 0;
}