Submission #1228945

#TimeUsernameProblemLanguageResultExecution timeMemory
1228945ripolasBouquet (EGOI24_bouquet)C++20
8 / 100
17 ms1864 KiB
#include <bits/stdc++.h> using namespace std; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); int n; cin>>n; vector<int> l(n); vector<int> dp(n); for(int i = 0;i<n;i++){ int r; cin>>l[i]>>r; } int ans = 0; for(int i = 0;i<n;i++){ if(i-l[i]-1>=0){ dp[i] = dp[i-l[i]-1]+1; }else{ dp[i] = 1; } ans = max(ans,dp[i]); } cout<<ans<<endl; } /* 4 1 0 1 0 1 0 4 0 */
#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...