Range Maximum Deconstruction (Easy)

**This is the easy version of the problem. The only difference this version and the hard version is that in this version, $N$ is always even. This problem is worth $30$ points.** For an array $A$ of length $N$, its *range maximum* array, denoted $B$, is another array of length $N$ constructed as follows. For each index $i$ ($1 \leq i \leq N$), - Let $k = \min(i, N-i+1)$. - Then, define $B_i$