UVA699 下落的树叶 The Falling Leaves

//
// Created by Oision on 2022/2/25.
//

#include <bits/stdc++.h>

using namespace std;

#define MAX_NUM  100005

int sum[MAX_NUM];

bool build(int idx) {
    int num;
    cin >> num;
    if (num == -1) {
        return 0;
    } else {
        sum[idx] += num;
        build(idx - 1);
        build(idx + 1);
    }
    return 1;
}

int main() {
    int count = 1;
    memset(sum, 0, sizeof(sum));
    while (build(MAX_NUM / 2)) {
        cout << "Case " << count++ << ":" << endl;
        for (int i = 0; i < MAX_NUM; i++) {
            if (sum[i] != 0) {
                if (sum[i + 1] == 0) {
                    cout << sum[i];
                    break;
                } else {
                    cout << sum[i] << " ";
                }
            }
        }
        cout << "\n\n";
        memset(sum, 0, sizeof(sum));
    }
    return 0;
}