<? echo $row['title']." - ".$MSG_PROBLEM." - ".$OJ_NAME; ?>

Problem2343--Climbing Takahashi

2343: Climbing Takahashi

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 128 MB

Submit Solved: 11 Submit Num: 12 Statistics

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

200

points

Problem Statement

There are

N

platforms arranged in a row. The height of the

i

-th platform from the left is

H_i

.
Takahashi is initially standing on the leftmost platform.
Since he likes heights, he will repeat the following move as long as possible.

If the platform he is standing on is not the rightmost one, and the next platform to the right has a height greater than that of the current platform, step onto the next platform.

Find the height of the final platform he will stand on.

Constraints

$\leq N \leq 10^5$
$\leq H_i \leq 10^9$
All values in input are integers.

Input

Input is given from Standard Input in the following format:

 $N$  $H_1$  $\ldots$  $H_N$

Output

Print the answer.

Sample Input Copy

5
1 5 10 4 2

Sample Output Copy

HINT

Takahashi is initially standing on the leftmost platform, whose height is $1$ . The next platform to the right has a height of $5$ and is higher than the current platform, so he steps onto it.

He is now standing on the $2$ -nd platform from the left, whose height is $5$ . The next platform to the right has a height of $10$ and is higher than the current platform, so he steps onto it.

He is now standing on the $3$ -rd platform from the left, whose height is $10$ . The next platform to the right has a height of $4$ and is lower than the current platform, so he stops moving.

Thus, the height of the final platform Takahashi will stand on is $10$ .

Source/Category

AtCoder

Submit