提出 #49945358

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/segtree>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

Num apply(Num a, Num b) {
    return std::max(a, b);
}

Num unit(void) {
    return 0;
}

void solve(std::istream& is, std::ostream& os) {
    Num n, d;
    is >> n >> d;

    using SegTree = atcoder::segtree<Num, apply, unit>;
    constexpr Num max_a = 500009;
    SegTree tree(max_a);
    Num init = 0;
    is >> init;
    tree.set(init, 1);

    for(Num i{1}; i<n; ++i) {
        Num a = 0;
        is >> a;

        Num l = std::max(0LL, a - d);
        Num r = std::min(max_a, a + d + 1);
        const auto mx = tree.prod(l, r);
        const auto new_m = std::max(tree.get(a), mx + 1);
        tree.set(a, new_m);
    }

    os << tree.prod(0, max_a) << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果