#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
using namespace std;
int main() {
int n; cin >> n;
pair<int,int> a[n];
for (auto& [x, y] : a) {
int pos, inf; cin >> pos >> inf;
x = inf + pos;
y = inf - pos;
}
sort(a, a+n);
vector<int> lis;
for (auto [x, y] : a) {
auto it = upper_bound(all(lis), y);
if (it == lis.end())
lis.push_back(y);
else
*it = y;
}
cout << lis.size();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |