#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> I(N);
for (int i = 0; i < N; ++i) {
cin >> I[i].first >> I[i].second;
}
vector<int> dp(N, 1);
for (int i = 0; i < N; ++i) {
for (int j = N - 1; j >= max(i - 5, 0); --j) {
if (j - max(I[j].first, I[i].second) > i) {
dp[i] = max(dp[i], dp[j] + 1);
}
}
}
int result = *max_element(dp.begin(), dp.end());
cout << result << endl;
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |