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 <bits/stdc++.h>
template <class T>
using Vec = std::vector<T>;
constexpr int INF = std::numeric_limits<int>::max() / 2;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, X;
std::cin >> N >> X;
Vec<int> A(N);
for (auto& x: A) {
std::cin >> x;
}
Vec<int> up(N + 1, INF), down(N + 1, INF);
up[0] = down[0] = -INF;
for (const auto x: A) {
const int u = std::lower_bound(up.begin(), up.end(), x) - up.begin();
const int d = std::lower_bound(down.begin(), down.end(), x) - down.begin();
up[u] = x;
down[d] = x;
down[u] = std::min(down[u], x - X);
}
std::cout << std::lower_bound(down.begin(), down.end(), INF) - down.begin() - 1 << '\n';
return 0;
}
# | 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... |