区间贪心问题

看下边链接的博客就好了
讲解博客

P1803 凌乱的yyy / 线段覆盖
题意：
给定 $n$ 个区间，从中尽可能选出多的区间而不相交
思路：
按照右端点靠前排序
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define mem(x, d) memset(x, d, sizeof(x))
#define eps 1e-6
using namespace std;
const int maxn = 2e6 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
struct node{
	int l, r;
	bool operator<(const node &B)const{
		return r < B.r;
	}
}a[maxn];

void work()
{
	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> a[i].l >> a[i].r;
	sort(a + 1, a + 1 + n);
	int ans = 0, last = -1;
	for(int i = 1; i <= n; ++i){
		if(last <= a[i].l) ++ans, last = a[i].r;
	}
	cout << ans;
}

int main()
{
	ios::sync_with_stdio(0);
//	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}

P1610 鸿山洞的灯
code：

void work()
{
	cin >> n >> m;for(int i = 1; i <= n; ++i) cin >> a[i];
	sort(a + 1, a + 1 + n);
	int last = a[1], ans = 0;
	for(int i = 2; i < n; ++i){
		if(a[i+1] - a[i-1] <= m){
			a[i] = a[i-1];// a[i]删掉之后，a[i-1]替换掉a[i]
			++ans;
		}
	}
	cout << ans;
}