【紫书】 The Falling Leaves UVA - 699 递归得简单

#define _CRT_SECURE_NO_WARNINGS
#include "stdio.h"
#include<stdio.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<iostream>
#include<string.h>
#include<queue>
#include<string>
#include<sstream>
using namespace std;
const int maxn = 80+5;
int sum[maxn],p;
void build(int p) {//更新以p为根的树对sum的贡献：更新根，更新leftson ,更新right son;
    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);
}
int main(){
    int kase = 0;
    while (init()) {
        int p = 0;
        while (sum[p] == 0)p++;
        cout << "Case " << ++kase << ":\n" << sum[p++];
        while (sum[p] != 0)cout << " " << sum[p++];
        cout << "\n\n";
    }
    //system("pause");
    return 0;
}