#include <bits/stdc++.h>
using namespace std;
vector<int>v;
int main() {
int n;
cin>>n;
int x,y;
int r=n;
while(r--){
cin>>x>>y;
v.push_back(x);
}
int tab[n];
tab[0]=1;
for(int so=1;so<n;so++){
tab[so]=0;
tab[so]=tab[so-v[so]]+1;
}
sort(tab,tab+n);
cout<<tab[n-1]<<endl;
}
# | 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... |