제출 #1047194

#제출 시각아이디문제언어결과실행 시간메모리
1047194EntityPlanttBouquet (EGOI24_bouquet)C++17
16 / 100
15 ms1240 KiB
#include <iostream> #include <cassert> using namespace std; const int N = 2e5 + 5; int dp[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0, l, r; i < n; i++) { cin >> l >> r; assert(r == 0); if (i) dp[i] = dp[i - 1]; else dp[i] = 1; if (i > l) dp[i] = max(dp[i], dp[i - l - 1] + 1); } cout << dp[n - 1]; 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...