# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1170548 | raymed | Bouquet (EGOI24_bouquet) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<pair<int,int>> I(N);
for (int i = 0; i < n; ++i) cin >> I.first >> I.second;
for (int i = 0; i < N; ++i) {
for (int j = N-1; j >= i-5; --j) {
if (j - max(I[j].first, I[i].second) > i) {
dp[i]= max(1, max(dp[i], dp[j] + 1));
}
}
}
}