Shave Beaver!

2000ms

262144K

Description:

The Smart Beaver has recently designed and built an innovative nanotechnologic all-purpose beaver mass shaving machine, "Beavershave 5000". Beavershave 5000 can shave beavers by families! How does it work? Very easily!

There are n beavers, each of them has a unique id from 1 to n. Consider a permutation a₁, a₂, ..., a_n of n these beavers. Beavershave 5000 needs one session to shave beavers with ids from x to y (inclusive) if and only if there are such indices i₁ < i₂ < ... < i_k, that a_i₁ = x, a_i₂ = x + 1, ..., a_{i_k - 1} = y - 1, a_{i_k} = y. And that is really convenient. For example, it needs one session to shave a permutation of beavers 1, 2, 3, ..., n.

If we can't shave beavers from x to y in one session, then we can split these beavers into groups [x, p₁], [p₁ + 1, p₂], ..., [p_m + 1, y] (x ≤ p₁ < p₂ < ... < p_m < y), in such a way that the machine can shave beavers in each group in one session. But then Beavershave 5000 needs m + 1 working sessions to shave beavers from x to y.

All beavers are restless and they keep trying to swap. So if we consider the problem more formally, we can consider queries of two types:

what is the minimum number of sessions that Beavershave 5000 needs to shave beavers with ids from x to y, inclusive?
two beavers on positions x and y (the beavers a_x and a_y) swapped.

You can assume that any beaver can be shaved any number of times.

Input:

The first line contains integer n — the total number of beavers, 2 ≤ n. The second line contains n space-separated integers — the initial beaver permutation.

The third line contains integer q — the number of queries, 1 ≤ q ≤ 10⁵. The next q lines contain the queries. Each query i looks as p_i x_i y_i, where p_i is the query type (1 is to shave beavers from x_i to y_i, inclusive, 2 is to swap beavers on positions x_i and y_i). All queries meet the condition: 1 ≤ x_i < y_i ≤ n.

to get 30 points, you need to solve the problem with constraints: n ≤ 100 (subproblem B1);
to get 100 points, you need to solve the problem with constraints: n ≤ 3·10⁵ (subproblems B1+B2).

Note that the number of queries q is limited 1 ≤ q ≤ 10⁵ in both subproblem B1 and subproblem B2.

Output:

For each query with p_i = 1, print the minimum number of Beavershave 5000 sessions.

Sample Input:

Sample Output:

Informação

Provedor Codeforces

Código CF331B1