uva 699 The Falling Leaves 二叉树

#include<cstring>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<climits>
#include<cctype>
#include<bitset>
#include<set>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
typedef long long LL;

const int MAXN=10005;
int sum[MAXN];
void build(int p){
int v;
scanf("%d",&v);
if(v==-1)return ;
sum[p]+=v;
build(p-1);
build(p+1);
}
bool init(){
memset(sum,0,sizeof(sum));
int v;
scanf("%d",&v);
if(v==-1)return 0;
int pos=MAXN/2;
sum[pos]+=v;
build(pos-1);
build(pos+1);
return 1;
}

int main()
{
int kase=0;
while(init()){
int p=0;
while(sum[p]==0)p++;
printf("Case %d:\n",++kase);
printf("%d",sum[p++]);
while(sum[p]){
printf(" %d",sum[p++]);
}
cout<<endl<<endl;
}
return 0;
}