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 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.

---

给你一颗树的前序遍历，让你遍历一棵树，这道题最难的还是建树这部分，每个水平位置 p 我们可以用数组sum[p]记录这个位置所有结点的值之和；

代码：

#include<bits/stdc++.h>
#define LL long long
#define pa pair<int,int>
#define lson k<<1
#define rson k<<1|1
#define inf 0x3f3f3f3f
//ios::sync_with_stdio(false);
using namespace std;
const int N=1000100;
const int M=4001000;
const LL mod=998244353;
int sum[N];
void build(int p){
	int rt;
	cin>>rt;
	if(rt==-1) return;
	sum[p]+=rt;
	build(p-1);
	build(p+1);
}
int main(){
	ios::sync_with_stdio(false);
	int c=0;
	while(1){
		int root;
		cin>>root;
		if(root==-1) break;
		memset(sum,0,sizeof(sum));
		int pos=N/2;//根结点的位置
		sum[pos]=root;
		build(pos-1),build(pos+1);
		int p=0;
		while(sum[p]==0) p++;
		++c;
		cout<<"Case "<<c<<":"<<endl<<sum[p++];
		while(sum[p]!=0) cout<<" "<<sum[p++];
		cout<<endl<<endl;
	}	
	return 0;
}