PAT顶级（二叉树DFS）——1006 Tree Traversals - Hard Version (35 分)

1006 Tree Traversals - Hard Version (35 分)

---

解题思路：

把握住前序中序后序遍历的特点：根节点=inorder[i]=preorder[0]=postorder[last],枚举每个中序的位置假设其为根节点向下递归求解，过程用引用进行赋值，完成树的构造

代码：

#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define G 6.67430*1e-11
#define  rd read()
#define pi 3.1415926535
using namespace std;
const ll mod = 998244353;
const int MAXN = 30000005;
const int MAX2 = 300005;
inline ll read() {
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9') {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
int get() {
    char s[20];
    scanf("%s", s);
    if (s[0] == '-') return 0;
    int res = 0;
    for (int i = 0; s[i]; i++) res = res * 10 + s[i] - '0';
    return res;
}
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
int n;
int in[105];
int pre[105];
int post[105];
int root;
pair<int, int> tree[105];
int ans[105];
bool dfs(int& now, int al, int ar, int bl, int br, int cl, int cr)
{
    if (al > ar) { now = 0; return true; }
    for (int i = al; i <= ar; i++)
    {
        if (in[i] && pre[bl] && in[i] != pre[bl])continue;
        if (in[i] && post[cr] && in[i] != post[cr])continue;
        if (pre[bl] && post[cr] && pre[bl] != post[cr])continue;
        now = i;
        ans[i] = max({ in[i],pre[bl],post[cr] });
        if (!dfs(tree[now].first, al, i - 1, bl + 1, bl + i - al, cl, cl + i - al - 1))continue;
        if (!dfs(tree[now].second, i + 1, ar, bl + i - al + 1, br, cl + i - al, cr - 1))continue;
        return true;
    }   
    return false;
}
int flag = 0;
void dfs(int now, int type)   
{
    if (now == 0)return;
    if (type == 1)
    {
        if (flag)cout << ' ';
        flag++;
        printf("%d", ans[now]);
    }
    dfs(tree[now].first, type);
    if (type == 2)
    {
        if (flag)cout << ' ';
        flag++;
        printf("%d", ans[now]);
    }
    dfs(tree[now].second, type);
    if (type == 3)
    {
        if (flag)cout << ' ';
        flag++;
        printf("%d", ans[now]);
    }
}
signed main()
{
    int n = rd;
    set<int> s;
    for (int i = 1; i <= n; i++)
    {
        in[i] = get();
        s.insert(in[i]);
    }
    for (int i = 1; i <= n; i++)
    {
        pre[i] = get();
        s.insert(pre[i]);
    }
    for (int i = 1; i <= n; i++)
    {
        post[i] = get();
        s.insert(post[i]);
    }
    vector<int> r;
    for (int i = 1; i <= n; i++)
    {
        if (s.count(i) == 0)
        {
            r.push_back(i);
        }
    }
    if (r.size() > 1 || (!dfs(root, 1, n , 1, n , 1, n )))cout << "Impossible";
    else
    {
        flag = 0;
        //cout << tree[root].first << ' ' << tree[root].second << endl;
        for (int i = 1; i <= n; i++)
        {
            if (!ans[i] && r.size())ans[i] = r[0];
        }
        dfs(root, 2);
        cout << endl;
        flag = 0;
        dfs(root, 1);
        cout << endl;
        flag = 0;
        dfs(root, 3);
        cout << endl;
        queue<int> q;
        q.push(root);
        while (q.size())
        {
            auto f = q.front();
            q.pop();
            if (f != root)
            {
                cout << ' ';
            }
            printf("%d", ans[f]);
            if (tree[f].first)q.push(tree[f].first);
            if (tree[f].second)q.push(tree[f].second);
        }
    }

    return 0;
}