Submission #1170482

#TimeUsernameProblemLanguageResultExecution timeMemory
1170482lopkusBouquet (EGOI24_bouquet)C++20
28 / 100
3096 ms2784 KiB
#include <bits/stdc++.h> int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n; std::cin >> n; std::vector<int> l(n + 1), r(n + 1); for(int i = 1; i <= n; i++) { std::cin >> l[i] >> r[i]; } std::vector<int> dp(n + 1, 1); for(int i = 1; i <= n; i++) { for(int j = i - l[i] - 1; j > 0; j--) { if(i > j + r[j]) { dp[i] = std::max(dp[i], dp[j] + 1); } } } int ans = 0; for(int i = 1; i <= n; i++) { //std::cout << dp[i] << " "; ans = std::max(dp[i], ans); } std::cout << "\n"; std::cout << ans; }
#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...