UVa 699 The Falling Leaves

#include <cstdio>#include <cstring>#include <iostream>using namespace std;const int maxn = 1e5;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() {  int v;  scanf("%d", &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() {//  freopen("input", "r", stdin);  int i = 0;  while (init()) {    printf("Case %d:\n", ++i);    int p = 0;    while (sum[p] == 0) p++;    printf("%d", sum[p++]);    while (sum[p] != 0) printf(" %d", sum[p++]);    printf("\n\n");  }}