d1p2 (CCO Canadian_Computing_Olympiad)
Time limit: 5 seconds | Memory limit: 1024 MB | Task type: batch
Algorithms: line sweep, data structures, segment tree

# 2023 Canadian Computing Olympiad
# Day 1, Problem 2
# Real Mountains

**Time Limit:** 5 seconds

## Problem Description

Thanks to your help with cropping her picture, Rebecca's scenic photo is now featured on the front cover of the newest issue of her magazine. However, it seems that some of her readers still aren't pleased with the picture. In particular, they seem to believe that the mountain in the picture is fake!

For simplicity, we can describe the picture as a sequence of $N$ columns of pixels. In the $i$-th column, the first $h_i$ pixels from the bottom are of mountains. Her readers will only believe that the picture contains a real mountain if it contains a single (possibly wide) peak. That is, if there exists some index $p$ with $1 \le p \le N$ such that $h_1 \le h_2 \le \dots \le h_p \ge \dots \ge h_{N-1} \ge h_N$.

Luckily, Rebecca can still pay her editors to modify the picture and reprint the magazine. Unfortunately for her though, the editors have a very peculiar pricing scheme for their work. The only way Rebecca can edit the picture is by sending emails to her editors containing the integers $(i, j, k)$ such that $1 \le i < j < k \le N$ and $h_i > h_j < h_k$. The editors will then add an extra pixel of mountains in the $j$-th column (i.e. increment $h_j$ by 1) for a cost of $h_i + h_j + h_k$ cents. Note that the change in $h_j$ may affect the costs of future edits.

To please her readers, Rebecca would like to edit the picture so that they believe it contains a real mountain. Can you tell her the minimum cost required to do so?

## Input Specification

The first line of input contains an integer $N$.

The second line of input contains $N$ space-separated integers $h_1, h_2, \dots, h_N$.

| Marks Awarded | Bounds on $N$ | Bounds and constraints on $h_i$                                                                                                                   |
| :------------ | :------------- | :----------------------------------------------------------------------------------------------------------------------------------------------- |
| 3 marks       | $3 \le N \le 5000$ | $1 \le h_i \le 100$;  <br> $h_1 \le h_2 \le \dots \le h_p \ge \dots \ge h_{N-1} \ge h_N$ <br> for some $p$, $1 \le p \le N$                        |
| 3 marks       | $3 \le N \le 5000$ | $1 \le h_i \le 100$                                                                                                                              |
| 3 marks       | $3 \le N \le 5000$ | $1 \le h_i \le 10^6$                                                                                                                             |
| 3 marks       | $3 \le N \le 5000$ | $1 \le h_i \le 10^9$                                                                                                                             |
| 4 marks       | $3 \le N \le 10^6$ | $1 \le h_i \le 100$                                                                                                                              |
| 5 marks       | $3 \le N \le 10^6$ | $1 \le h_i \le 10^6$                                                                                                                             |
| 4 marks       | $3 \le N \le 10^6$ | $1 \le h_i \le 10^9$                                                                                                                             |

## Output Specification

Output the remainder of $T$ divided by the prime number $10^6 + 3$ where $T$ is the minimum cost (in cents) that Rebecca would need to incur in order to please her readers.

## Sample Input

```
8
3 2 4 5 4 1 2 1
```

## Output for Sample Input

```
14

Starter code:

Grader code:

Setup script:

Evaluation script: