贪心区间问题

#include<iostream>
#include<algorithm>
const int N=1e5+10;
using namespace std;
struct Range{
    int l,r;
    bool operator<(const Range &w)const
    {
        return r<w.r;
    }
    
}range[N];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int l,r;
        cin>>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;
}

区间选点问题

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int N=1e5+10;
struct Range{
    int l,r;
    bool operator<(const Range &w)const{
        return l<w.l;
    }
}range[N];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int l,r;
        cin>>l>>r;
        range[i] = {l,r};
    }
    sort(range,range+n);
    priority_queue<int,vector<int>,greater<int>> heap;
    for(int i=0;i<n;i++){
        auto r = range[i];
        if(heap.empty() || heap.top() >= r.l)heap.push(r.r);
        else{
            int t=heap.top();
            heap.pop();
            heap.push(r.r);
    }
    }
    printf("%d",heap.size());
    
    return 0;
}

区间分组

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int N=1e5+10;
struct Range{
    int l,r;
    bool operator<(const Range &w)const{
        return l<w.l;
    }
}range[N];
int main(){
    int st ,ed;
    cin>>st>>ed;
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int l,r;
        cin>>l>>r;
        range[i] = {l,r};
    }
    sort(range,range+n);
    int res=0;
    bool sucess = false;
    for(int i=0;i<n;i++){
        int j=i,r=-2e9;
        while(j<n && range[j].l<=st){
            r=max(r,range[j].r);
            j++;
        }
        if(r<st){
            res=-1;
            break;
        }
        res++;
        if(r>=ed){
            sucess = true;
            break;
        }
        st=r;
        i=j-1;
    }
    if(!sucess)res=-1;
    printf("%d",res);
    
    
    return 0;
}

区间合并