AtCoder Beginner Contest 152
翻译中…
Problem Statement
翻译中…
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翻译中…
Output
翻译中…
Print the number of integers $i$ that satisfy the condition.
翻译中…
样例
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
4
Input #5
1
1
Output #5
1
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。