Submission #1170559

#TimeUsernameProblemLanguageResultExecution timeMemory
1170559samiaBouquet (EGOI24_bouquet)C++20
0 / 100
35 ms1980 KiB
#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; if(so-v[so]>=0){ tab[so]+=tab[so-v[so]]+1;} else{tab[so]+=1;} } sort(tab,tab+n); cout<<tab[n-1]<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...