[UVA] The Falling Leaves

题目：https://vjudge.net/problem/UVA-699

#include<iostream>
#include<vector>
#include<cstring>

using namespace std;
const int maxn = 200;
int sum[maxn];

void build(int pos)
{
	int v;
	cin >> v;
	if (v == -1) return;
	sum[pos] += v;
	build(pos - 1);
	build(pos + 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);
	return true;
}


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";
	}

	return 0;
}