【区间选点】

Kent_J_Truman

于 2024-10-07 15:45:00 发布

阅读量106

点赞数 1

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/m0_73669127/article/details/142741526

版权

算法专栏收录该内容

130 篇文章 0 订阅

订阅专栏

题目

代码

左端点排序+区间合并

#include <bits/stdc++.h>
using namespace std;
#define null -0x3f3f3f3f
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 1e5+10;
vector<PII> v;
int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        v.push_back({l,r});
    }
    
    sort(v.begin(), v.end());
    
    int ans = 0;
    int l = null, r = null;
    for(auto c : v)
    {
        int x = c.x, y = c.y;
        if(l == null) l = x, r = y;
        else
        {
            if(x > r) ans++, l = x, r = y;
            else if(y > r) l = x;
            else l = x, r = y;
        }
    }
    
    ans += 1;
    
    cout << ans;
}

右端点排序+贪心

#include <bits/stdc++.h>
using namespace std;
#define null -0x3f3f3f3f
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 1e5+10;
vector<PII> v;
int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        v.push_back({r, l});
    }
    
    sort(v.begin(), v.end());
    
    int ans = 1;
    int end = v[0].x;
    for(auto c : v)
    {
        int l = c.y, r = c.x;
        if(l > end) end = r, ans++;
    }
    
    cout << ans;
}