Great Ocean View

AtCoder

IDabc124_b

Time2000ms

Memory256MB

Difficulty—

There are $N$ mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the $i$\-th mountain from the west is $H_i$. You can certainly see the ocean from the inn at the top of the westmost mountain. For the inn at the top of the $i$\-th mountain from the west $(i = 2, 3, ..., N)$, you can see the ocean if and only if $H_1 \leq H_i$, $H_2 \leq H_i$, $...$, and $H_{i-1} \leq H_i$. From how many of these $N$ inns can you see the ocean? ## Constraints * All values in input are integers. * $1 \leq N \leq 20$ * $1 \leq H_i \leq 100$ ## Input Input is given from Standard Input in the following format: $N$ $H_1$ $H_2$ $...$ $H_N$ [samples]

Samples

Input #1

4
6 5 6 8

Output #1

3

You can see the ocean from the first, third and fourth inns from the west.

Input #2

5
4 5 3 5 4

Output #2

Input #3

5
9 5 6 8 4

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Great Ocean View",
    "description": {
      "content": "There are $N$ mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the $",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc124_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ mountains ranging from east to west, and an ocean to the west.\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\nThe height of the $...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments