Submission #1237597

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237597		clemmy14	Bouquet (EGOI24_bouquet)	C++20	0 / 100	35 ms	2632 KiB

Main

#include<bits/stdc++.h>
using namespace std;

signed main() {
    int n; cin >> n;
    vector<int> l(n), r(n);
    for(int i=0; i<n; i++) cin >> l[i] >> r[i];
   
    vector<int> dp(n, 1); 
    for(int i=0; i<n; i++) {
        for(int j=i-1; j>max(0, i-6); j--) {
            if(j+r[j] < i && j < i-l[i]) dp[i]=max(dp[i], dp[j]+1);
            else dp[i]=max(dp[i], dp[j]);
        }
    }
    cout << dp[n-1];
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 16
• Subtask 3: 0 / 28
• Subtask 4: 0 / 18
• Subtask 5: 0 / 30