Low Elements

AtCoder

IDabc152_c

Time2000ms

Memory256MB

Difficulty—

Given is a permutation $P_1, \ldots, P_N$ of $1, \ldots, N$. Find the number of integers $i$ $(1 \leq i \leq N)$ that satisfy the following condition: * For any integer $j$ $(1 \leq j \leq i)$, $P_i \leq P_j$. ## Constraints * $1 \leq N \leq 2 \times 10^5$ * $P_1, \ldots, P_N$ is a permutation of $1, \ldots, N$. * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $P_1$ $...$ $P_N$ [samples]

Samples

Input #1

5
4 2 5 1 3

Output #1

3

$i=1$, $2$, and $4$ satisfy the condition, but $i=3$ does not - for example, $P_i > P_j$ holds for $j = 1$.  
Similarly, $i=5$ does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.

Input #2

4
4 3 2 1

Output #2

4

All integers $i$ $(1 \leq i \leq N)$ satisfy the condition.

Input #3

6
1 2 3 4 5 6

Output #3

1

Only $i=1$ satisfies the condition.

Input #4

8
5 7 4 2 6 8 1 3

Output #4

Input #5

1
1

Output #5

API Response (JSON)

{
  "problem": {
    "name": "Low Elements",
    "description": {
      "content": "Given is a permutation $P_1, \\ldots, P_N$ of $1, \\ldots, N$. Find the number of integers $i$ $(1 \\leq i \\leq N)$ that satisfy the following condition: *   For any integer $j$ $(1 \\leq j \\leq i)$, $P_",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc152_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given is a permutation $P_1, \\ldots, P_N$ of $1, \\ldots, N$. Find the number of integers $i$ $(1 \\leq i \\leq N)$ that satisfy the following condition:\n\n*   For any integer $j$ $(1 \\leq j \\leq i)$, $P_...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments