CF1057A.Bmail Computer Network

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given the values $p_i$ — the index of the router to which the $i$ -th router was connected after being purchased ( $p_i < i$ ).

There are $n$ routers in Boogle in total now. Print the sequence of routers on the path from the first to the $n$ -th router.

输入格式

The first line contains integer number $n$ ( $2 \le n \le 200000$ ) — the number of the routers. The following line contains $n-1$ integers $p_2, p_3, \dots, p_n$ ( $1 \le p_i < i$ ), where $p_i$ is equal to index of the router to which the $i$ -th was connected after purchase.

输出格式

Print the path from the $1$ -st to the $n$ -th router. It starts with $1$ and ends with $n$ . All the elements in the path should be distinct.

输入输出样例

输入#1
```
8
1 1 2 2 3 2 5
```
输出#1
```
1 2 5 8 
```
输入#2
```
6
1 2 3 4 5
```
输出#2
```
1 2 3 4 5 6 
```
输入#3
```
7
1 1 2 3 4 3
```
输出#3
```
1 3 7 
```

首页