Acwing 908. 最大不相交区间数量

知识点

1. 贪心

题目描述

思路讲解

代码展示

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;

struct Range {
    int l, r;

    bool operator<(const Range &W) const {
        return r < W.r;
    }
} range[N];

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d%d", &range[i].l, &range[i].r);

    sort(range, range + n);

    int res = 0, ed = -2e9;
    for (int i = 0; i < n; i++)
        if (ed < range[i].l) {
            res++;
            ed = range[i].r;
        }

    printf("%d", res);

    return 0;
}