#include <iostream>
using namespace std;
#define f first
#define s second
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// freopen("input.in","r",stdin);
int N;cin>>N;
pair<int,int> d[N];
int nT[N];
for(int i=0;i<N;i++){
cin>>d[i].f>>d[i].s;
}
int m=0;
for(int i=0;i<N;i++){
if(((i-d[i].f)-1) < 0){
nT[i]=1;
}
else{
nT[i]=nT[((i-d[i].f)-1)]+1;
}
nT[i]=max(nT[i],m);
m=max(nT[i],m);
}
cout<<m;
}
# | 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... |