s2 — CCO Canadian_Computing_Competition_Senior
Task type: batch | Time limit: 1 s | Memory limit: 512 MB | Difficulty: 12
Algorithms: dynamic programming

# Problem S2: Symmetric Mountains

## Problem Description

Rebecca is a tour guide and is trying to market the Rocky Mountains for her magazine. She recently took a beautiful picture consisting of $N$ mountains where the $i$-th mountain from the left has a height $h_i$. She will crop this picture for her magazine, by possibly removing some mountains from the left side of the picture and possibly removing some mountains from the right side of the picture. That is, a crop consists of consecutive mountains starting from the $l$-th to the $r$-th mountain where $l \le r$. To please her magazine readers, Rebecca will try to find the most symmetric crop.

We will measure the asymmetric value of a crop as the sum of the absolute difference for every pair of mountains equidistant from the midpoint of the crop. To help understand that definition, note that the absolute value of a number $v$, written as $|v|$, is the non-negative value of $v$: for example $|-6| = 6$ and $|14| = 14$. The asymmetric value of a crop is the sum of all $|h_{l+i} - h_{r-i}|$ for $0 \le i \le \frac{r-l}{2}$. To put that formula in a different way, we pair up the mountains working from the outside in toward the centre, calculate the absolute difference in height of each of these pairs, and sum them up.

Because Rebecca does not know how wide the picture needs to be, for all possible crop lengths, find the asymmetric value of the most symmetric crop (the crop with the minimum asymmetric value).

## Input Specification

The first line consists of an integer $N$, representing the number of mountains in the picture. The second line consists of $N$ space-separated integers, where the $i$-th integer from the left represents $h_i$.

The following table shows how the available 15 marks are distributed:

| Marks | Bounds on $N$   | Bounds on $h_i$    | Additional Constraints                                                                 |
| :---- | :--------------- | :----------------- | :------------------------------------------------------------------------------------- |
| 5     | $1 \le N \le 300$ | $0 \le h_i \le 10^5$ | None                                                                                    |
| 5     | $1 \le N \le 5000$ | $0 \le h_i \le 10^5$ | Height of mountains are in non-decreasing order from left to right. |
| 5     | $1 \le N \le 5000$ | $0 \le h_i \le 10^5$ | None                                                                                    |

## Output Specification

Output on one line $N$ space-separated integers, where the $i$-th integer from the left is the asymmetric value of the most symmetric picture of crops of length $i$.

```
Sample Input 1
7
3 1 4 1 5 9 2
```

La version française figure à la suite de la version anglaise.

```
Output for Sample Input 1
0 2 0 5 2 10 10
```

## Explanation of Output for Sample Input 1

We will show why the fifth value from the left is 2. Let us try to compute all the asymmetric values of crops with length 5.

The height of the mountains in the first crop is $[3, 1, 4, 1, 5]$. The asymmetric value of this crop is $|3 - 5| + |1 - 1| + |4 - 4| = 2$.

The height of the mountains in the second crop is $[1, 4, 1, 5, 9]$. The asymmetric value of this crop is $|1 - 9| + |4 - 5| + |1 - 1| = 9$.

The height of the mountains in the last crop is $[4, 1, 5, 9, 2]$. The asymmetric value of this crop is $|4 - 2| + |1 - 9| + |5 - 5| = 10$.

Hence, the most symmetric crop of length 5 is 2.

```
Sample Input 2
4
1 3 5 6
```

```
Output for Sample Input 2
0 1 3 7

Starter code: