浙江大学机试 二叉搜索树 Easy *考点：两个遍历序列确定一棵子树

#include<iostream>
#include<string>
#include<vector>
#include<queue>
using namespace std;

const int maxn = 1000000;
int num[maxn];
int pa[maxn];

void init() {
	fill(num, num + maxn, -1);
	//fill(pa, pa + maxn, -1);
}

void insert(int n,int root,int (&inn)[maxn]) {
	if (inn[root] == -1) {
		inn[root] = n;
		return;
	}
	if (inn[root] > n) {
		insert(n, root * 2,inn);
	}
	else {
		insert(n, root * 2 + 1,inn);
	}
}

void charge(string s) {
	fill(pa, pa + maxn, -1);
	for (int i = 0; i < s.size(); i++) {
		insert(s[i] - ‘0‘, 1, pa);
	}
	for (int i = 0; i < maxn; i++) {
		if (pa[i] != num[i]) {
			cout << "NO" << endl;
			return;
		}
	}
	cout << "YES" << endl;
	return;
}

int main() {
	int n;
	string s;
	while (cin >> n) {
		if (n == 0)
			break;
		cin >> s;
		init();
		for (int i = 0; i < s.size(); i++) {
			insert(s[i] - ‘0‘, 1,num);
		}
		for (int i = 0; i < n; i++) {
			cin >> s;
			charge(s);
		}
	}
	
}