Submission #1170542

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170542		FZ_Laabidi	Bouquet (EGOI24_bouquet)	C++20	8 / 100	58 ms	1984 KiB

Main

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

int main() {
    int n; cin >> n;
    vector<int> flowers(n+1);
    vector<int> dp(n, 1);
    int k=0;
    for(int i = 0; i < n; i++)
        cin >> flowers[i] >> k ;

    int c=0, i=0;
    for (int i=0; i<n; i++) {
        if (i-flowers[i]>0)dp[i]= max(dp[i], dp[i-flowers[i]-1]+1);
    }
    cout << max(1, *max_element(dp.begin(), dp.end()))<< endl;;
  // for (int i=0; i<n; i++)cout << dp[i]<< " ";
}

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