// Problem: [USACO 2006 Ope B]Cows on a Leash
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/20960/1047
// Memory Limit: 65536 MB
// Time Limit: 2000 ms
// 2022-02-25 15:19:54
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair
const ll mod = 1e9 + 7;
inline ll qmi (ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) ans = ans * a%mod;
a = a * a %mod;
b >>= 1;
}
return ans;
}
inline int read () {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f?-x:x;
}
template<typename T> void print(T x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) print(x/10);
putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
return (a + b) %mod;
}
inline ll inv (ll a) {
return qmi(a, mod - 2);
}
bool cmp (pii a, pii b) {
if (a.se == b.se)
return a.fi < b.fi;
return a.se < b.se;
}
void solve() {
int n;
cin >> n;
vector<pii> range(n);
map<int, int> a;
for (int i = 0; i < n ;i ++) {
int l, r;
cin >> l >> r;
range[i] = {l, l + r};
}
sort(range.begin(), range.end(), cmp);
ll r = -1;
int ans = 0;
for (int i = 0; i < n; i ++) {
if (r <= range[i].fi) {
r = range[i].se;
ans ++;
}
}
cout << ans << endl;
}
int main () {
int t;
t =1;
//cin >> t;
while (t --) solve();
return 0;
}
一开始是按照区间覆盖来做的。但是后面就发现太复杂了,而且不能解决这个问题。 我们可以按照结束位置来排序,然后贪心,如果按照开始的位置来排, 存在一个区间[l1, r1] [l2, r2] l1 < l2 r1 > r2 我们会发现这种排法会比我们的方案多。所以不是最优的