ACM篇：Uva 699 -- The Falling Leaves

最新推荐文章于 2019-08-11 12:05:50 发布

Ace_is_my_name

最新推荐文章于 2019-08-11 12:05:50 发布

阅读量476

点赞数

文章标签： uva acm

本文链接：https://blog.csdn.net/ace_is_my_name/article/details/54341465

版权

注意输出格式。

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <cmath>
#include <cstdlib>
using namespace std;

struct Node
{
    int val;
    int rank;
    Node *left, *right;
    Node(int val, int rank) : val(val), rank(rank), left(NULL), right(NULL) {}
};

Node *root = NULL;
int left_edge = 0;
int right_edge = 0;
Node* build_tree(int rank)
{
    Node *u = NULL;
    int v;
    scanf("%d", &v);
    if (v != -1)
    {
        u = new Node(v, rank);
        u->val = v;
        if (rank < 0)
            left_edge = max(left_edge, -rank);
        else
            right_edge = max(right_edge, rank);
        u->left = build_tree(rank-1);
        u->right = build_tree(rank+1);
    }
    return u;
}

const int MAXN = 128; 
int sum[MAXN];
void _dfs(Node *u)
{
    if (!u)
        return;
    sum[u->rank + left_edge] += u->val;
    _dfs(u->left);
    _dfs(u->right);
}
void _print()
{
    static int kase = 1;
    int sz = left_edge + right_edge + 1;
    printf("Case %d:\n", kase++);
    for (int i = 0; i < sz; i++)
        printf("%d%s", sum[i], (i == sz-1) ? "\n\n" : " ");
}
void remove_tree(Node *u)
{
    if (!u)
        return;
    remove_tree(u->left);
    remove_tree(u->right);
    delete(u);
}

int main()
{
    while (root = build_tree(0))
    {
        _dfs(root);
        _print();
        remove_tree(root);
        left_edge = right_edge = 0;
        memset(sum, 0, sizeof(sum));
    }
    return 0;
}