#include <bits/stdc++.h> using namespace std; #define POPCOUNT(n) (__builtin_popcountll((n))) #define CLZ(n) (__builtin_clzll((n))) #define CTZ(n) (__builtin_ctzll((n))) #define LOG(n) (63 - __builtin_clzll((n))) #define BIT(n, i) (((n) >> (i)) & 1ll) #define MASK(i) (1ll << (i)) #define FLIP(n, i) ((n) ^ (1ll << (i))) #define ON(n, i) ((n) | MASK(i)) #define OFF(n, i) ((n) & ~MASK(i)) #define Int __int128 #define fi first #define se second typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pii; typedef pair<long long, long long> pll; typedef pair<long long, int> pli; typedef pair<int, long long> pil; typedef vector<pair<int, int>> vii; typedef vector<pair<long long, long long>> vll; typedef vector<pair<long long, int>> vli; typedef vector<pair<int, long long>> vil; template <class T1, class T2> bool maximize(T1 &x, T2 y) { if (x < y) { x = y; return true; } return false; } template <class T1, class T2> bool minimize(T1 &x, T2 y) { if (x > y) { x = y; return true; } return false; } template <class T> void remove_duplicate(vector<T> &ve) { sort (ve.begin(), ve.end()); ve.resize(unique(ve.begin(), ve.end()) - ve.begin()); } mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); long long random(long long l, long long r) { return uniform_int_distribution<long long>(l, r)(rng); } unsigned long long random(unsigned long long l, unsigned long long r) { return uniform_int_distribution<unsigned long long>(l, r)(rng); } template <class T> T random(T r) { return rng() % r; } const int N = 1e6 + 5; const int MOD = 1e9 + 7; const int inf = 1e9 + 69; const long long INF = 1e18; int n, q; int h[N], a[N], b[N]; vector<int> events[N]; struct SegmentTree { const pii DEFAULT = {-inf, inf}; vii nodes; int n; SegmentTree(int _n = 0) { resize(_n); } void resize(int _n) { n = _n; nodes.assign(4 * n + 5, DEFAULT); } pii merge(pii x, pii y) { return make_pair(max(x.fi, y.fi), min(x.se, y.se)); } void update(int id, int l, int r, int p, int val) { if (l == r) { if (val != inf) nodes[id] = make_pair(val, val); else nodes[id] = DEFAULT; return; } int mid = (l + r) >> 1; if (p <= mid) update(id << 1, l, mid, p, val); else update(id << 1 | 1, mid + 1, r, p, val); nodes[id] = merge(nodes[id << 1], nodes[id << 1 | 1]); } void update(int p, int val) { update(1, 1, n, p, val); } pii get(int id, int l, int r, int u, int v) { if (l > v || r < u) return DEFAULT; if (u <= l && r <= v) return nodes[id]; int mid = (l + r) >> 1; return merge(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v)); } pii get(int u, int v) { maximize(u, 1); minimize(v, n); if (u > v) return DEFAULT; return get(1, 1, n, u, v); } }; void addEvent(int p, int type) { if (p <= n) events[p].emplace_back(type); } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 1; i <= n; ++i) cin >> h[i] >> a[i] >> b[i]; cin >> q; while (q--) { int l, r; cin >> l >> r; SegmentTree mytree(n); for (int i = l; i <= r; ++i) events[i].clear(); int ans = -inf; for (int i = l; i <= r; ++i) { for (auto pos : events[i]) { if (pos > 0) mytree.update(pos, h[pos]); else mytree.update(-pos, inf); } auto [maxH, minH] = mytree.get(i - b[i], i - a[i]); // cerr << maxH << ' ' << minH << ' ' << i - b[i] << ' ' << i - a[i] << '\n'; maximize(ans, maxH - h[i]); maximize(ans, h[i] - minH); addEvent(i + a[i], i); addEvent(i + b[i] + 1, -i); } if (ans < 0) ans = -1; cout << ans << '\n'; } return 0; }