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 on the right:

                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.

 给一棵二叉树，每个节点都有一个水平位置：左子节点在它左边1个单位，右子节点在右边1个单位。从左向右输出每个水平位置的所有节点的权值之和。如图所示，从左到右的三个位置的权和分别为7,11,3，按照递归（先序）方式输入，用-1表示空树。

先序输入如果没有读到-1，会一直递归下去，会一直读左节点。

因为是同一竖行，所以要控制下标。左减一，右加一。即可。

#include<stdio.h>
#include<string.h>
int tree[100],L,R;
void build(int num,int pos)
{
    int x,y;
    if (num!=-1)//如果为-1， 返回上一层 
    {
        if (pos<L)
            L=pos;
        if (pos>R)
            R=pos;
        tree[pos]+=num;//相同的下标值会累加 
        scanf("%d",&x);//如果pos=50 输进来的为根节点 
        build(x,pos-1);//先序输入，开始时为左节点
        scanf("%d",&y);//当左节点为-1时，开始输入右节点 
        build(y,pos+1);//当递归到最后一层 ，函数会结束。 
    }
}
int main()
{
    int i,n,sum=0;
    while (scanf("%d",&n)&&n!=-1)//首先输入第一个值，如果为-1，结束程序 
    {
        memset(tree,0,sizeof(tree));
        sum++;
        L=50;//题目限制为最多40个，开大一点 
        R=50;//L是左边的长度,R是右边的长度   刚开始是为0，都在中间 
        build(n,50);//从根节点开始输入 
        printf("Case %d:\n",sum);
        for (i=L;i<R;i++)
            printf("%d ", tree[i]);
        printf("%d\n\n",tree[R]);
    }
    return 0;
}