UVa 699 (二叉树) The Falling Leaves

 1 //#define LOCAL
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 const int maxn = 2000;
 8 int sum[maxn];
 9 
10 void build(int p)
11 {
12     int v;
13     scanf("%d", &v);
14     if(v == -1)    return;
15     sum[p] += v;
16     build(p - 1);
17     build(p + 1);
18 }
19 
20 bool Init()
21 {
22     int v;
23     scanf("%d", &v);
24     if(v == -1)    return false;
25     memset(sum, 0, sizeof(sum));
26     int pos = maxn / 2;
27     sum[pos] = v;
28     build(pos - 1);
29     build(pos + 1);
30     return true;
31 }
32 
33 int main(void)
34 {
35     #ifdef LOCAL
36         freopen("699in.txt", "r", stdin);
37     #endif
38 
39     int kase = 1;
40     while(Init())
41     {
42         int p = 0;
43         while(sum[p] == 0) p++;
44         //if(kase > 1)    printf("\n");
45         printf("Case %d:\n%d", kase++, sum[p++]);
46         while(sum[p] != 0)    printf(" %d", sum[p++]);
47         printf("\n\n");
48     }
49 
50     return 0;
51 }