带权树_weighttree_中后序建树

最新推荐文章于 2023-06-12 19:30:40 发布

KikiDMW

最新推荐文章于 2023-06-12 19:30:40 发布

阅读量492

点赞数

分类专栏：建树

本文链接：https://blog.csdn.net/kikidmw/article/details/50963227

版权

建树专栏收录该内容

3 篇文章 0 订阅

订阅专栏

UVA 548

这道题写得就没那么费劲了然而还是要大呼几声“stringstream大法好”

#include<cstdio>
#include<string>
#include<sstream>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxv = 10000 + 10;
int in_order[maxv], post_order[maxv], lch[maxv], rch[maxv];//in_order中序，post_order后序
int n;

bool read_list(int* a){
    //memset(a, 0, sizeof(a));
    string line;
    if(!getline(cin, line)) return false;
    stringstream ss(line); // stringstream大法好
    n = 0;
    int x;
    while(ss >> x) a[n++] = x;
    return n > 0;
}

int build(int L1, int R1, int L2, int R2){ //中序L1-R1,后序L2-R2建树，返回树根
    if(L1 > R1) return 0;
    int root = post_order[R2];
    int p = L1;
    while(in_order[p] != root) p++;
    int cnt = p - L1; //左子树结点个数
    lch[root] = build(L1, p-1, L2, L2+cnt-1);
    rch[root] = build(p+1, R1, L2+cnt, R2-1);
    return root;
}

int best, best_sum; //最优解叶子的权和对应的权和

void dfs(int u, int sum){
    sum += u;
    if(!lch[u] && !rch[u])
        if(sum < best_sum || (sum == best_sum && u < best)) {
            best = u;
            best_sum = sum;
        }
    if(lch[u]) dfs(lch[u], sum);
    if(rch[u]) dfs(rch[u], sum);
}

int main(){
    freopen("weighttree.in", "r", stdin);
    freopen("weighttree.out", "w", stdout);
    while(read_list(in_order)){
        read_list(post_order);
        //memset(lch, 0 ,sizeof(lch));
        //memset(rch, 0, sizeof(rch));
        build(0, n-1, 0, n-1);
        best_sum = 1<<30;
        best = 1<<30;
        dfs(post_order[n-1], 0);
        cout << best << endl;
    }
    return 0;
}