标签：des   style   blog   http   io   ar   color   os   sp   

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 

Output 

Sample Input 

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

Sample Output 

Case 1:
7 11 3

Case 2:
9 7 21 15

二叉树建树即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
typedef long long LL;
using namespace std;
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define CLEAR( a , x ) memset ( a , x , sizeof a )
typedef struct Node{
    int data;
    struct Node *lchild;
    struct Node *rchild;
}Node;
Node *T;
int num[550];
int x,n;
Node *CreatTree(int n)
{
    if(n==-1)
        return NULL;
    Node *t=(Node*)malloc(sizeof(Node));
    t->data=n;
    t->lchild=t->rchild=NULL;
    cin>>x;
    t->lchild=CreatTree(x);
    cin>>x;
    t->rchild=CreatTree(x);
    return t;
}
void dfs(Node *t,int cnt)
{
    if(t==NULL)  return ;
    num[cnt]+=t->data;
    dfs(t->lchild,cnt-1);
    dfs(t->rchild,cnt+1);
}
int main()
{
    int cas=0;
    while(cin>>n&&n!=-1)
    {
        CLEAR(num,0);
        T=CreatTree(n);
        dfs(T,50);
        int flag=0;
        cout<<"Case "<<++cas<<":"<<endl;
        for(int i=0;i<100;i++)
        {
            if(num[i])
            {
                if(!flag)  cout<<num[i];
                else   cout<<" "<<num[i];
                flag=1;
            }
        }
        cout<<endl<<endl;
    }
    return 0;
}

UVA 399 The Falling Leaves(二叉树）

标签：des   style   blog   http   io   ar   color   os   sp   

原文地址：http://blog.csdn.net/u013582254/article/details/41747813