#include <limits> #include <initializer_list> #include <utility> #include <bitset> #include <tuple> #include <type_traits> #include <functional> #include <string> #include <array> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <map> #include <set> #include <unordered_map> #include <unordered_set> #include <iterator> #include <algorithm> #include <complex> #include <random> #include <numeric> #include <iostream> #include <iomanip> #include <sstream> #include <regex> #include <cassert> #include <cstddef> #include <variant> #define endl codeforces #define ALL(v) std::begin(v), std::end(v) #define ALLR(v) std::rbegin(v), std::rend(v) using ll = std::int64_t; using ull = std::uint64_t; using pii = std::pair<int, int>; using tii = std::tuple<int, int, int>; using pll = std::pair<ll, ll>; using tll = std::tuple<ll, ll, ll>; using size_type = ssize_t; template <typename T> using vec = std::vector<T>; template <typename T> using vvec = vec<vec<T>>; template <typename T> const T& var_min(const T &t) { return t; } template <typename T> const T& var_max(const T &t) { return t; } template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; }; template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; }; template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type; template <typename T, typename F, typename... Args> void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } } template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); } template <typename T, typename... Tail> auto make_v(size_type hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); } namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } template <typename T> T ceil_pow2(T bound) { T ret = 1; while (ret < bound) ret *= 2; return ret; } template <typename T> T ceil_div(T a, T b) { return a / b + !!(a % b); } int main() { ll n; std::cin >> n; vec<ll> xv(n); for (ll &e : xv) std::cin >> e; ll q; std::cin >> q; vec<tll> qv(q); for (auto &[ l, r, x ] : qv) { std::cin >> l >> r >> x; l--; } auto sxv = xv; std::sort(ALL(sxv)); const ll bsz = std::sqrt(n); vvec<ll> qidx(bsz + 10); for (ll i = 0; i < q; i++) { const auto l = std::get<0>(qv[i]); const auto ite = std::lower_bound(ALL(sxv), l); const auto idx = std::distance(sxv.begin(), ite); qidx[idx / bsz].push_back(i); } for (auto &v : qidx) { std::sort(ALL(v), [&](const ll i, const ll j) { const auto r1 = std::get<1>(qv[i]); const auto r2 = std::get<1>(qv[j]); return r1 < r2; }); } const ll inf = 5e15; vec<ll> ans(q, inf); for (auto &bv : qidx) { if (bv.empty()) continue; auto [ cl, cr, cx ] = qv[bv[0]]; std::set<ll> xset; auto add = [&](const ll x) { xset.insert(x); }; auto del = [&](const ll x) { xset.erase(x); }; for (ll i = cl; i < cr; i++) xset.insert(xv[i]); for (const auto i : bv) { const auto [ l, r, x ] = qv[i]; while (cl < l) del(xv[cl++]); while (l < cl) add(xv[--cl]); while (cr < r) add(xv[cr++]); auto ite = xset.lower_bound(x); if (ite != xset.end()) chmin(ans[i], std::abs(*ite - x)); if (ite != xset.begin()) { auto ite2 = prev(ite); chmin(ans[i], std::abs(*ite2 - x)); } } } for (ll e : ans) std::cout << e << "\n"; return 0; }