习题6-11(uva-10410)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1005;

vector<int> result[maxn];
int bfs[maxn], dfs[maxn],n,m;
stack<int> st;

int main()
{
	while (cin >> n && n) {
		int a = 0, b = 0;
		for (int i = 1; i <= n; i++) {
			result[i].clear();
			cin >> m;
			bfs[m] = i;
		}

		while (!st.empty()) st.pop();

		cin >> a;
		st.push(a);

		for (int i = 2; i <= n; i++) {
			cin >> b;
			while (true)
			{
				a = st.top();
				//是子节点
				if (bfs[a] == 1 || bfs[a] + 1 < bfs[b] || (bfs[a] + 1 == bfs[b] && a > b)) {
					st.push(b);
					result[a].push_back(b);
					break;
				}
				else
					st.pop();
			}
		}

		for (int i = 1; i <= n; i++) {
			cout << i << ":";
			for (int j = 0; j < result[i].size(); j++) {
				cout << " " << result[i][j];
			}
			cout << endl;
		}
	}
	return 0;
}