AcWing 908. 最大不相交区间数量
原题链接
简单
作者:
跟着灿哥学切菜
,
2021-01-20 09:59:58
,
所有人可见
,
阅读 220
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
struct Range{
int l, r;
bool operator< (const Range &W)const {
return r < W.r;
}
}Range[N];
int n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i ++) {
int l, r;
scanf("%d%d", &l, &r);
Range[i] = {l, r};
}
sort(Range, Range + n);
int res = 0, ed = -2e9;
for (int i = 0; i < n; i ++) {
if (Range[i].l > ed) {
res ++;
ed = Range[i].r;
}
}
printf("%d", res);
return 0;
}