27199번 - Bob's Average 다국어

문제

In a course in mathematical statistics, Bob came up with a new way to calculate the average for arrays containing an odd number of elements.

As long as the length of the array is greater than one, the following operation is performed: an arbitrary segment of the array of length 3 with boundaries $l$ and $r = l + 2$ is selected, the median of these three elements is calculated and then these elements are replaced by one element equal to the median.

The median of an array of three elements is the second-highest element of this array. For example, the median of the array $[1, 5, 4]$ is 4ドル,ドル and the median the array $[2, 2, 2]$ is 2ドル$.

Let's consider one of the ways to calculate the Bob's average on an array $[4, 1, 3, 2, 5]$. In the first step, we select a sub-section with boundaries $l = 2,ドル $r = 4$. Since 2ドル$ is the median of the subarray $[1, 3, 2],ドル then the array is converted as follows: $[4, 1, 3, 2, 5] \rightarrow [4, 2, 5]$. In the second step, the only possible segment of length 3ドル$ has boundaries $l = 1,ドル $r = 3$. Since 4ドル$ is the median of the subarray $[4, 2, 5],ドル then $[4, 2, 5] \rightarrow [4]$.

Bob noticed that his method of calculating the average is not quite correctly defined: depending on the choice of segments, the result of the calculation may be different. To fix this situation, Bob decided to choose segments to replace with the median in such a way that the only number remaining at the end was the maximum possible. It is this number that Bob calls Bob's average for this array.

For an array $a$ of $n$ elements, you need to answer $q$ queries, The $j$-th of those queries is characterized by the boundaries of $L_j$ and $R_j$.

The answer to the $i$-th query is the Bob's average of the segment of the original array $[a_{L_j}, a_{L_j + 1}, \ldots a_{R_j}]$. For all queries, it is guaranteed that the length of the query segment is odd.

입력

The first line contains an integer $n$ (3ドル \leq n \leq 5 \cdot 10^4$) --- array size.

The second line contains $n$ integers $a_i$ (0ドル \leq a_i \leq 10^9$) --- array elements.

The third line contains an integer $q$ (1ドル \leq q \leq 10^5$) --- number of requests.

The following $q$ lines contain integers $L_j,ドル $R_j$ (1ドル \leq L_j \leq R_j \leq n$) --- the boundaries of the sub-section of the $j$-th query, it is guaranteed that $R_j - L_j + 1$ is not divisible by 2ドル$.

출력

In the $j$-th line of the output, output a single integer --- the answer to the $j$-th request.

제한

힌트