Submission #1228947

#TimeUsernameProblemLanguageResultExecution timeMemory
1228947ripolasBouquet (EGOI24_bouquet)C++20
0 / 100
3095 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,0);
    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){
            for(int j = 0;j<=i-l[i]-1;j++){
                dp[i] = max(dp[i],dp[j]+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...