Submission #66447327

---

Source Code Expand

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

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>>;

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

constexpr Num Inf = 1000000000LL;

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

Num func_unit() {
    return -Inf;
}

Num func_map(Num a, Num b) {
    return a + b;
}

Num func_compose(Num a, Num b) {
    return a + b;
}

Num func_id() {
    return 0;
}

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

    std::vector<std::pair<Num,Num>> vs;
    for(Num i{0}; i<n; ++i) {
        Num h;
        is >> h;
        vs.push_back(std::make_pair(-h,i));
    }
    std::ranges::sort(vs);

    atcoder::lazy_segtree<Num, func_operate, func_unit, Num, func_map, func_compose, func_id> tree(n);
    std::deque<std::pair<Num,Num>> wq;
    Num ans {0};

    for(const auto& [nh, center] : vs) {
        const auto h = -nh;
        const Num left = std::max(0LL, center - r);
        const Num right = std::min(n, center + r + 1);

        while(!wq.empty()) {
            const auto [w, pos] = wq.front();
            if (h > (w - d)) {
                break;
            }

            wq.pop_front();
            if (tree.get(pos) >= 0) {
                tree.apply(pos, pos+1, 1);
            } else {
                tree.apply(pos, pos+1, Inf+1);
            }

            Num mx = tree.prod(left, right);

            if (mx >= 0) {
                tree.apply(center, center+1, mx);
                ans = std::max(ans, mx);
            }
        }

        wq.push_back(std::make_pair(h, center));
    }

    os << ans << "\n";
}

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

Submission Info

Judge Result