CF270B.Multithreading

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The first line of input contains an integer $n$ , the number of threads ( $1<=n<=10^{5}$ ). The next line contains a list of $n$ space-separated integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ where $a_{i}$ ( $1<=a_{i}<=n$ ) is the old position of the $i$ -th thread in the new list. It is guaranteed that all of the $a_{i}$ are distinct.

输入格式

Output a single integer — the number of threads that surely contain a new message.

输出格式

In the first test case, threads 2 and 5 are placed before the thread 1, so these threads must contain new messages. Threads 1, 3 and 4 may contain no new messages, if only threads 2 and 5 have new messages.

In the second test case, there may be no new messages at all, since the thread order hasn't changed.

In the third test case, only thread 1 can contain no new messages.

输入输出样例

输入#1
```
5
5 2 1 3 4
```
输出#1
```
2
```
输入#2
```
3
1 2 3
```
输出#2
```
0
```
输入#3
```
4
4 3 2 1
```
输出#3
```
3
```

说明/提示

In the second test case, there may be no new messages at all, since the thread order hasn't changed.

In the third test case, only thread 1 can contain no new messages.

首页