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.

Sample Input 

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

Sample Output 

Case 1:7 11 3Case 2:9 7 21 15

// 题意：给一棵二叉树，每个节点都有一个水平位置：
          左儿子在它左边1个单位，右儿子在右边1个单位。
         从左向右输出每个水平位置的所有结点的权值之和。
        按照递归方式输入，-1表示空树

 算法：在“建树”的同时计算，无须真正的把树保存下来

#include<cstring>#include<iostream>#include<cstdio>#include<cstring>using namespace std;int s[200];void build(int x){     int n;     scanf("%d",&n);// 输入并统计一棵子树，树根水平位置为x     if(n==-1) return;//空树     s[x]+=n;     build(x-1);     build(x+1);}int fill(){int n,x;scanf("%d",&n);if(n==-1) return 0;memset(s,0,sizeof(s));x=100;s[x]=n;build(x-1);//左  build(x+1); //右}int main(){    int k=1,x;  while(fill())  {     x=0;     while(s[x]==0) x++;//找最左边的叶子     printf("Case %d:\n%d",k++,s[x++]);     while(s[x]!=0)     {       printf(" %d",s[x]);       x++;                   }     printf("\n\n");  }    return 0;}