as soon as possible!!! here in this issue explanation, You have a change: a group a=[a1,a2,… ,an] of obvious entire numbers from 1 to n. The length of the change n is odd. You need to sort the change in growing solicitation. In one phase, you can pick any prefix of the change with an odd length and inverse it. Authoritatively, if a=[a1,a2,… ,an], you can pick any odd number p among 1 and n, complete, and set a to [ap,ap−1,… ,a1,ap+1,ap+
python as soon as possible!!!
here in this issue explanation, You have a change: a group a=[a1,a2,… ,an] of obvious entire numbers from 1 to n. The length of the change n is odd. You need to sort the change in growing solicitation. In one phase, you can pick any prefix of the change with an odd length and inverse it. Authoritatively, if a=[a1,a2,… ,an], you can pick any odd number p among 1 and n, complete, and set a to [ap,ap−1,… ,a1,ap+1,ap+2,… ,an].
Sort out some way to sort a using near 5n2 reversals of the above kind, or set up that such a way doesn't exist. The amount of reversals shouldn't be restricted.
Data input: Each test contains various investigations. The essential line contains the amount of investigations t (1≤t≤100). Portrayal of the analyses follows. The chief line of each examination contains a lone entire number n (3≤n≤2021; n is odd) — the length of the change. The resulting line contains n specific entire numbers a1,a2,… ,an (1≤
It is guaranteed that the measure of n over everything tests doesn't outperform 2021.
Yield output: For each examination, in the event that it's hard to sort the given change in everything thought about 5n2 reversals, print a singular entire number −1.
Regardless, print a number m (0≤m≤5n2), demonstrating the amount of reversals in your plan of steps, followed by m entire numbers pi (1≤pi≤n; pi is odd), connoting the lengths of the prefixes of a to be convoluted, in consecutive solicitation.
Note that m shouldn't be restricted. On the off chance that there are various answers, print any
Step by step
Solved in 4 steps with 1 images
