# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853038 | lovrot | Global Warming (CEOI18_glo) | C++17 | 61 ms | 4020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 2e5 + 10;
const int oo = 2e9 + 10;
int n, x, A[N];
int LIS[N], L[N];
int main() {
scanf("%d%d", &n, &x);
for(int i = 0; i < n; ++i) LIS[i] = oo;
for(int i = 0; i < n; ++i) {
scanf("%d", A + i);
int j = lower_bound(LIS, LIS + n, A[i]) - LIS;
LIS[j] = A[i];
L[i] = j;
}
for(int i = 0; i < n; ++i) LIS[i] = -oo;
int ans = 0;
for(int i = n - 1; i >= 0; --i) {
ans = max(ans, (int) (lower_bound(LIS, LIS + n, A[i] - x, [](int a, int b) {
return a > b;
}) - LIS) + L[i] + 1);
int j = lower_bound(LIS, LIS + n, A[i], [](int a, int b) { return a > b; }) - LIS;
LIS[j] = A[i];
}
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... |