# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1238681 | Jer | Bouquet (EGOI24_bouquet) | C++20 | 3095 ms | 2352 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int l[MAXN], r[MAXN];
int n;
int dp[MAXN];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d%d", &l[i], &r[i]);
dp[0] = 1;
int ma;
for (int i = 1; i < n; ++i)
{
ma = 0;
for (int j = 0; j < i; ++j)
if (j < i - l[i] and i > j + r[j])
ma = max(ma, dp[j]);
dp[i] = 1 + ma;
}
ma = 0;
for (int i = 0; i < n; ++i)
ma = max(ma, dp[i]);
printf("%d\n", ma);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |