The Falling Leaves UVA - 699

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
const int maxn=1e6+5;
int sum[maxn];
void build(int p)
{
    int v;
    cin>>v;
    if(v==-1) return ;
    sum[p]+=v;
    build(p-1);
    build(p+1);
}
bool init()
{
    int v;
    cin>>v;
    if(v==-1) return false;
    memset(sum,0,sizeof(sum));
    int pos=maxn/2;
    sum[pos]=v;
    build(pos-1);
    build(pos+1);
    return true ;
}
int main()
{
    int ca=0;
    while(init())
    {
        int p=0;
        while(sum[p]==0) p++;//找到最左边的叶子
        //cout<<"Case "<<++ca<<":"<<endl;
        printf("Case %d:\n",++ca);
        cout<<sum[p++];
        while(sum[p]!=0) cout<<" "<<sum[p++];
        cout<<endl<<endl;
    }
    return 0;
}