Submission #1318852

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318852		killerzaluu	Bouquet (EGOI24_bouquet)	C++20	28 / 100	3095 ms	2736 KiB

Main

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

int main() {
    int n;
    cin >> n;

    vector<int> l(n + 1), r(n + 1); // 1-indexed
    for (int i = 1; i <= n; i++) cin >> l[i] >> r[i];

    vector<int> dp(n + 1, 1); // dp[i] = 1 initially, because we pick flower i
    int ans = 1;

    for (int i = 2; i <= n; i++) {
        int left_ignore = l[i];
        for (int j = i - left_ignore - 1; j >= 1; j--) {
            if (j + r[j] < i) { // if picking j does not block i
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
        ans = max(ans, dp[i]);
    }

    cout << ans;
    return 0;
}

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