제출 #1228913

#제출 시각아이디문제언어결과실행 시간메모리
1228913Rokas159Bouquet (EGOI24_bouquet)C++20
0 / 100
20 ms5100 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'

signed main() {
    cin.tie(nullptr); cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    int l[n], r[n];

    for (int i = 0; i < n; i++) {
        cin >> l[i] >> r[i];

        
    }

    int dp[n+1];

    dp[0] = 0;

    int ans = 0;

    for (int i = 1; i <= n; i++) {
        dp[i] = max(dp[i-1], dp[max(0ll, i-l[i-1])-1] + 1);

        ans = max(ans, dp[i]);
    }

    cout << ans << endl;

    cout.flush();
    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...