1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/*
 * @uni_kakurenbo
 * https://github.com/uni-kakurenbo/competitive-programming-workspace
 *
 * CC0 1.0  http://creativecommons.org/publicdomain/zero/1.0/deed.ja
 */
/* #language C++ 20 GCC */

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1549"

#include <bits/stdc++.h><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include "snippet/aliases.hpp"
#include "snippet/fast_io.hpp"
#include "snippet/iterations.hpp"
#include "adaptor/valarray.hpp"
#include "adaptor/io.hpp"
#include "data_structure/wavelet_matrix.hpp"

signed main() {
    uni::i32 n; input >> n;
    std::vector<uni::i32> a(n); ITRR(v, a) input >> v;

    uni::wavelet_matrix<uni::ll> data(a);
    // debug(data);

    uni::i32 q; input >> q;
    REP(q) {
        uni::i32 l, r, x; input >> l >> r >> x; ++r;

        auto prv = data(l, r).prev_element(x);
        auto nxt = data(l, r).next_element(x);
        // if(prv != data(l, r).end()) assert(*prv == data(l, r).prev(x));
        // if(nxt != data(l, r).end()) assert(*nxt == data(l, r).next(x));

        print(
            std::min(
                std::abs((prv == data(l, r).end() ? INT64_MAX : *prv) - x),
                std::abs((nxt == data(l, r).end() ? INT64_MAX : *nxt) - x)
            )
        );
    }
}