# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235001 | badge881 | Global Warming (CEOI18_glo) | C++20 | 41 ms | 2508 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, d;
scanf("%d%d\n", &n, &d);
int a[n], p[n];
vector<int> lis;
for (int i = 0; i < n; i++)
{
scanf("%d\n", &a[i]);
size_t ind = lower_bound(lis.begin(), lis.end(), a[i]) - lis.begin();
if (ind == lis.size())
lis.push_back(a[i]);
else
lis[ind] = a[i];
p[i] = ind + 1;
}
int ans = lis.size();
lis.clear();
for (int i = n - 1; i >= 0; i--)
{
size_t ind = lower_bound(lis.begin(), lis.end(), -a[i]) - lis.begin();
if (ind == lis.size())
lis.push_back(-a[i]);
else
lis[ind] = -a[i];
if (i == 0)
continue;
int k = lower_bound(lis.begin(), lis.end(), d - a[i - 1]) - lis.begin();
ans = max(ans, k + p[i - 1]);
}
printf("%d\n", ans);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |