1138 Postorder Traversal (25 分)

Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the corresponding binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 50,000), the total number of nodes in the binary tree. The second line gives the preorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the first number of the postorder traversal sequence of the corresponding binary tree.

Sample Input:

7
1 2 3 4 5 6 7
2 3 1 5 4 7 6

Sample Output:

3

思路：建树，找第一个点。

 AC代码：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <string.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define sdddd(x,y,z,k) scanf("%d%d%d%d", &x, &y, &z, &k)
#define sddd(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define sdd(x,y) scanf("%d%d", &x, &y)
#define sd(x) scanf("%d", &x)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
//#define mp Debug(x) printf("%d\n", &x);
#define pb push_back
#define ms(x, y) memset(x, y, sizeof x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1046513837;
const int maxn = 1e6 + 50;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
//typedef vector<ll> vec;
//typedef vector<vec> mat;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}

struct Node{
    int val;
    Node *l = nullptr, *r = nullptr;
};
int pre[maxn], in[maxn];
Node *rebuild(int prel, int prer, int inl, int inr){
    if(prer < prel) return nullptr;
    int len = prer - prel + 1;
    int cnt = 0;
    rep(i, inl, inr){
        if(pre[prel] == in[i])
            break;
        cnt++;
    }

    Node *p = new Node;
    p->val = pre[prel];
    p->l = rebuild(prel+1, prel + cnt, inl, inl + cnt - 1);
    p->r = rebuild(prer - (len - cnt - 1) + 1, prer, inr - (len - cnt - 1) + 1 , inr);
    return p;
}
vector<int> ans;
void post(Node *rt){
    if(rt == nullptr || ans.size()) return;
    post(rt->l);
    post(rt->r);
    ans.push_back(rt->val);
}
int main() {
    int n;
    cin >> n;
    rep(i, 1, n)
        cin >> pre[i];
    rep(i, 1, n)
        cin >> in[i];

    Node *rt = rebuild(1,n,1,n);
    post(rt);
    cout << ans[0] << endl;
	return 0;
}

/*
6 8
6 3 1 2 5 4 8 7
2 5
8 7
1 9
12 -3
0 8
99 99
*/