#include<bits/stdc++.h>
using namespace std;
signed main() {
int n; cin >> n;
vector<int> l(n), r(n);
for(int i=0; i<n; i++) cin >> l[i] >> r[i];
vector<int> dp(n, 0);
for(int i=0; i<n; i++) {
int prev=0;
if(i-l[i] > 0) prev = dp[i-l[i]-1];
dp[i]=max(dp[i-1], prev+1);
}
cout << dp[n-1];
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... |