专栏首页calmounduva 699 The Falling Leaves

uva 699 The Falling Leaves

Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing happened to binary trees, how large would the piles of leaves become?

We assume each node in a binary tree "drops" a number of leaves equal to the integer value stored in that node. We also assume that these leaves drop vertically to the ground (thankfully, there's no wind to blow them around). Finally, we assume that the nodes are positioned horizontally in such a manner that the left and right children of a node are exactly one unit to the left and one unit to the right, respectively, of their parent. Consider the following tree:

The nodes containing 5 and 6 have the same horizontal position (with different vertical positions, of course). The node containing 7 is one unit to the left of those containing 5 and 6, and the node containing 3 is one unit to their right. When the "leaves" drop from these nodes, three piles are created: the leftmost one contains 7 leaves (from the leftmost node), the next contains 11 (from the nodes containing 5 and 6), and the rightmost pile contains 3. (While it is true that only leaf nodes in a tree would logically have leaves, we ignore that in this problem.)

Input The input contains multiple test cases, each describing a single tree. A tree is specified by giving the value in the root node, followed by the description of the left subtree, and then the description of the right subtree. If a subtree is empty, the value -1 is supplied. Thus the tree shown above is specified as 5 7 -1 6 -1 -1 3 -1 -1. Each actual tree node contains a positive, non-zero value. The last test case is followed by a single -1 (which would otherwise represent an empty tree).

Output For each test case, display the case number (they are numbered sequentially, starting with 1) on a line by itself. On the next line display the number of "leaves" in each pile, from left to right, with a single space separating each value. This display must start in column 1, and will not exceed the width of an 80-character line. Follow the output for each case by a blank line. This format is illustrated in the examples below. 题意:每个叶子在垂直方向落叶,最后垂直和是多少?

5 7 -1 6 -1 -1 3 -1 -1 8 2 9 -1 -1 6 5 -1 -1 12 -1 -1 3 7 -1 -1 -1 -1

Case 1: 7 11 3

Case 2: 9 7 21 15

#include<stdio.h>
#include<string.h>

typedef struct Node
{
    int data;
    struct Node *left;
    struct Node *right;
};

Node *root;
int cnt;//计算-1的个数
int a[220];

Node *CreaTree(int n)
{
    if(n==-1)
    {
        return NULL;
    }
    Node *t=new Node;
    t->data=n;
    t->left=t->right=NULL;
    scanf("%d",&n);
    t->left=CreaTree(n);
    scanf("%d",&n);
    t->right=CreaTree(n);
    return t;
}

void DFS(Node *root,int cnt)
{
    if(root==NULL) return ;//cnt++
    a[cnt]+=root->data;
    DFS(root->left,cnt-1);
    DFS(root->right,cnt+1);
}

int main()
{
    int cas=1;
    int n,i;
    int mm=0;
    while(1)
    {
		scanf("%d",&n);
        memset(a,0,sizeof(a));
        if(n==-1) break;
        root=CreaTree(n);
        DFS(root,40);//原先这里传递的是cnt/2,cnt是-1的总和,1 1 1 1 -1 -1 -1 -1 -1这组数据就错了
        int flag=0;
        printf("Case %d:\n",cas++);
        for(i=0; i<=100; i++)
        {
            if(a[i])
            {
                if(flag) printf(" ");//原先flag在外面,必须先确定a[i]为真
                flag=1;
                printf("%d",a[i]);
            }
        }
        printf("\n");
        printf("\n");
    }
    return 0;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • UVa Automatic Editing

    uva的题真的很好,每个题都能长许多知识,A了后很开心,这道题我用了两天写,只一道题就学了四个函数,成长不少 Problem E: Automatic Edit...

    用户1624346
  • UVA Hangman Judge

    英语太烂啊。 In ``Hangman Judge,'' you are to write a program that judges a series of ...

    用户1624346
  • poj 3126 Prime Path

    Description ? The ministers of the cabinet were quite upset by the message from ...

    用户1624346
  • 解决RL好奇心探索后遗忘的问题

    Amplifying the Imitation Effect for Reinforcement Learning of

    用户1908973
  • Kubernetes GC in v1.3

    本文是对kubernetes GC proposal的解读分析,是对GC in kubernetes v1.3的内部结构剖析,并记录了其中一些关键点,以便日后能...

    Walton
  • ZOJ 3623 Battle Ships

    Battle Ships Time Limit: 2 Seconds Memory Limit: 65536 KB Battle Ships is a ne...

    风骨散人Chiam
  • CodeForces - 140A New Year Table (几何题)当时没想出来-----补题

    A. New Year Table time limit per test2 seconds memory limit per test256 megaby...

    风骨散人Chiam
  • 论综合 | 是什么让一个数字前端实现硅农开始学习Floorplan 的?

    如题,是什么让一个数字前端实现硅农开始学习Floorplan 的?是制造工艺的进步,是实现方法学的被迫更新,是养家糊口生的本能,正可谓:头发落完终不悔,为伊消得...

    老秃胖驴
  • POJ1611 (并查集)

    Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetio...

    dejavu1zz
  • 2019.8.15乘兴打Codeforces Round #569 (Div. 2)小记

    Recently, on the course of algorithms and data structures, Valeriy learned how t...

    glm233

扫码关注云+社区

领取腾讯云代金券