Submission #1269179

#TimeUsernameProblemLanguageResultExecution timeMemory
1269179chinhhoangBouquet (EGOI24_bouquet)C++20
0 / 100
3094 ms4932 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, res = 1;
    cin >> n;
    ll l[n+1], r[n+1], dp[n+1];
    for (ll i = 1; i <= n; i++) 
    {
        cin >> l[i] >> r[i];
        dp[i] = 0;
    }
    dp[0] = 0;
    dp[1] = 1;
    for (ll i = 2; i <= n; i++)
    {
        for (ll j = 1; j < i; j++)
        {
            if (i - j >= l[i] + 1 && i - j >= r[j] + 1)
                dp[i] = dp[j] + 1;
            else dp[i] = max(dp[i], dp[i-1]);
        }
        res = max(res, dp[i]);
    }
    cout << res;
    return 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...