UVA 548－Tree

UVA 548－Tree

题目大意：给出一棵树的中序遍历和后序遍历，求出路径上权之和最少的路

解题思路：由后序遍历可得到头节点，然后用中序遍历利用递归不断分割，建好树后递归找最小值

#include <iostream>
#include <sstream>
#include <string>
using namespace std;
const int maxi = 10000 + 100;
int mid[maxi], post[maxi];
int Lro[maxi], Rro[maxi];
int mi;
int re;
int read(int *m) {
    string l;
    int a;
    int n = 0;
    getline(cin, l);
    stringstream ss(l);
    while(ss >> a) 
        m[n++] = a;
    return n;
}

int tree(int L1, int R1, int L2, int R2) {
    if(L1 > R1) {
        return 0;
    }
    int root =post[R2];
    int i = L1;
    for(; mid[i] != root; i++);
    int num = i - L1;
    Lro[root] = tree(L1, i - 1, L2, L2+num-1);
    Rro[root] = tree(i+1, R1, L2 +num, R2-1);
    return root;
}

void find(int root, int sum) {
    sum = sum + root;
    if(Lro[root] == 0 && Rro[root] == 0)
    {
        if(sum < mi || (sum == mi && root < re)) {
            mi = sum;
            re = root;
        }
    }
    else {
        if(Lro[root] != 0)
            find(Lro[root], sum);
        if(Rro[root] != 0)
            find(Rro[root], sum);
    }
}
int main() {
    while(read(mid)) {
        int ro;
        mi = 100000;
        int n = read(post);
        ro = tree(0, n-1, 0, n-1);
        find(ro, 0);
        cout << re << "\n";
    }
    return 0;
}