Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <cstdio>
- #include <iostream>
- #include <cmath>
- #include <vector>
- #include <stack>
- #include <algorithm>
- using namespace std;
- vector<vector <int>> way;
- stack<int> st;
- vector<bool> used;
- vector<int> ans;
- void dfs(int pos)
- {
- ans.push_back(pos);
- st.pop();
- for (int i = 0; i < way[pos].size(); i++)
- if (used[way[pos][i]]) {
- used[way[pos][i]] = false;
- st.push(way[pos][i]);
- }
- if (!st.empty())
- dfs(st.top());
- return;
- }
- int main()
- {
- int n;
- scanf("%d", &n);
- way.resize(n + 1);
- used.resize(n + 1, true);
- used[1] = false;
- st.push(1);
- int k = 2;
- for (int i = 0; i < n - 1; i++)
- {
- int a;
- scanf("%d", &a);
- way[a].push_back(k);
- k++;
- }
- dfs(1);
- for (int i = 0; i < ans.size(); i++)
- printf("%d ", ans[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement