Mind Control
Contest: Codeforces Round 616 (Div. 1)
Difficulty rating: 1600
Tags: brute force, data structures, implementation

You and your $$$n - 1$$$ friends have found an array of integers $$$a_1, a_2, \dots, a_n$$$. You have decided to share it in the following way: All $$$n$$$ of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process.

You are standing in the $$$m$$$-th position in the line. Before the process starts, you may choose up to $$$k$$$ different people in the line, and persuade them to always take either the first or the last element in the array on their turn (for each person his own choice, not necessarily equal for all people), no matter what the elements themselves are. Once the process starts, you cannot persuade any more people, and you cannot change the choices for the people you already persuaded.

Suppose that you're doing your choices optimally. What is the greatest integer $$$x$$$ such that, no matter what are the choices of the friends you didn't choose to control, the element you will take from the array will be greater than or equal to $$$x$$$?

Please note that the friends you don't control may do their choice arbitrarily, and they will not necessarily take the biggest element available.

Input format:
The input consists of multiple test cases. The first line contains a single integer $$$t$$$ ($$$1 \le t \le 1000$$$)  — the number of test cases. The description of the test cases follows.

The first line of each test case contains three space-separated integers $$$n$$$, $$$m$$$ and $$$k$$$ ($$$1 \le m \le n \le 3500$$$, $$$0 \le k \le n - 1$$$)  — the number of elements in the array, your position in line and the number of people whose choices you can fix.

The second line of each test case contains $$$n$$$ positive integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^9$$$)  — elements of the array.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$3500$$$.

Output format:
For each test case, print the largest integer $$$x$$$ such that you can guarantee to obtain at least $$$x$$$.

Constraints:
Time limit: 1.0 s
Memory limit: 256.0 MB

Note:
In the first test case, an optimal strategy is to force the first person to take the last element and the second person to take the first element.

- the first person will take the last element ($$$5$$$) because he or she was forced by you to take the last element. After this turn the remaining array will be $$$[2, 9, 2, 3, 8]$$$;
- the second person will take the first element ($$$2$$$) because he or she was forced by you to take the first element. After this turn the remaining array will be $$$[9, 2, 3, 8]$$$;
- if the third person will choose to take the first element ($$$9$$$), at your turn the remaining array will be $$$[2, 3, 8]$$$ and you will take $$$8$$$ (the last element);
- if the third person will choose to take the last element ($$$8$$$), at your turn the remaining array will be $$$[9, 2, 3]$$$ and you will take $$$9$$$ (the first element).

Thus, this strategy guarantees to end up with at least $$$8$$$. We can prove that there is no strategy that guarantees to end up with at least $$$9$$$. Hence, the answer is $$$8$$$.

In the second test case, an optimal strategy is to force the first person to take the first element. Then, in the worst case, both the second and the third person will take the first element: you will end up with $$$4$$$.

Example input:
4
6 4 2
2 9 2 3 8 5
4 4 1
2 13 60 4
4 1 3
1 2 2 1
2 2 0
1 2

Example output:
8
4
1
1

Editorial:
People behind you are useless, ignore them. Let's assume that $$$k \le m-1$$$. It's always optimal to control as many people as possible.
Your strategy can be summarized by a single integer $$$x$$$, the number of people you force to take the first element (among the $$$k$$$ you control).
Similarly, the strategy of your opponents can be summarized by a single integer integer $$$y$$$, the number of non-controlled friends who choose to take the first element.
When it will be your turn, the array will contain exactly $$$n-m+1$$$ elements. You will be able to take the biggest element among the first element $$$a_{1+x+y}$$$ and the last element $$$a_{1+x+y+(n-m)}$$$.
These observations lead to an obvious $$$O(n^2)$$$ solution (iterate over all strategies $$$x$$$ and for each strategy, iterate over all cases $$$y$$$), which was sufficient to pass the tests.
However, the second iteration can be easily optimized with a data structure.
Let's note $$$b_i = \max(a_{1+i}, a_{1+i+(n-m)})$$$. The final answer is $$$\displaystyle \max_{x \in [0 ; k]} \bigg[ \min_{y \in [0 ; m-1-k]} b_{x+y} \bigg]$$$.
Note that it can be rewritten as $$$\displaystyle \max_{x \in [0 ; k]} \bigg[ \min_{y' \in [x ; x+m-1-k]} b_{y'} \bigg]$$$.
It can be computed in $$$O(n \log n)$$$ using segment tree or in $$$O(n)$$$ using monotonic deque.