erclmA - Online C++0x Compiler & Debugging Tool

// ~~ icebear love atttttttttttt ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i, n) for(int i=0; i<(n); ++i)
#define red(i, n) for(int i=(n)-1; i>=0; --i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebearat"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll LLinf = 1e18 + 27092008;
const int N = 4e5 + 5;
int n, q, par[N][19];
ii range[N];
vector<int> compress;
int curId = 0;
int st[N << 2], lazy[N << 2];

void pushDown(int id) {
    int &t = lazy[id];
    if (t) {
        st[id << 1] += t;
        lazy[id << 1] += t;
        st[id << 1 | 1] += t;
        lazy[id << 1 | 1] += t;
        t = 0;
    }
}

void update(int id, int l, int r, int u, int v, int k) {
    if (l > v || r < u) return;
    if (u <= l && r <= v) {
        st[id] += k;
        lazy[id] += k;
        return;
    }
    pushDown(id);
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, u, v, k);
    update(id << 1 | 1, mid + 1, r, u, v, k);
    st[id] = max(st[id << 1], st[id << 1 | 1]);
}

int getMax(int id, int l, int r, int u, int v) {
    if (l > v || r < u) return 0;
    if (u <= l && r <= v) return st[id];
    pushDown(id);
    int mid = (l + r) >> 1;
    return max(getMax(id << 1, l, mid, u, v),
               getMax(id << 1 | 1, mid + 1, r, u, v));
}

void init() {
    cin >> n;
    FOR(i, 1, n) cin >> range[i].fi >> range[i].se, compress.pb(range[i].fi), compress.pb(range[i].se);

    sort(all(compress));
    compress.resize(unique(all(compress)) - compress.begin());

    FOR(i, 1, n) {
        range[i].fi = lower_bound(all(compress), range[i].fi) - compress.begin() + 1;
        range[i].se = lower_bound(all(compress), range[i].se) - compress.begin() + 1;
    }
}

void prepare() {
    int j = n;
    memset(par, 0x3f, sizeof par);
    FORR(i, n, 1) {
        while(getMax(1, 1, N - 5, range[i].fi, range[i].se)) {
            update(1, 1, N - 5, range[j].fi, range[j].se, -1);
            j--;
        }
        update(1, 1, N - 5, range[i].fi, range[i].se, +1);
        par[i][0] = j + 1;
    }

    FOR(j, 1, 18) FOR(i, 1, n + 1)
        if (par[i][j - 1] <= n + 1) par[i][j] = par[par[i][j - 1]][j - 1];
}

void solve() {
    init();
    prepare();
    cin >> q;
    while(q--) {
        int l, r;
        cin >> l >> r;
        int ans = 0;
        FORR(j, 18, 0) {
            if (l <= r && par[l][j] - 1 <= r) {
                ans += (1 << j);
                l = par[l][j];
            }
        }
        if (l <= r) ans++;
        cout << ans << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//     cin >> tc;
    while(tc--) solve();
    return 0;
}