uva 699 The Falling Leaves

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN=1000+10;
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 initial()
{
    int v;
    scanf("%d",&v);
    memset(sum,0,sizeof(sum));
    if(v==-1) return false;
    int pos=MAXN/2;
    sum[pos]=v;
    build(pos-1);
    build(pos+1);
    return true;
}
int main()
{
    int kase=0;
    while(initial())
    {
        int p=0;
        while(sum[p]==0) p++;
        printf("Case %d:\n",++kase);
        printf("%d",sum[p++]);
        while(sum[p]) printf(" %d",sum[p++]);
        printf("\n\n");
    }
    return 0;
}