Submission #1170546

#TimeUsernameProblemLanguageResultExecution timeMemory
1170546FZ_LaabidiBouquet (EGOI24_bouquet)C++20
0 / 100
3096 ms2632 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> flowers(n+1); vector<int> dp(n, 1), pref(n, 0); int k=0; for(int i = 0; i < n; i++)cin >> flowers[i] >> k ; for (int i=0; i<n; i++) { for (int j=0; j<i-flowers[i]; j++) { dp[i]= max(dp[i], dp[j]+1); } } cout << *max_element(dp.begin(), dp.end())<< endl;; }
#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...