紫书UVa699

解法一

#include <vector>
#include <map>
#include<algorithm>
#include<cmath>
#include<set>
#include<cstdio>
#include <sstream>
#include <string>
#include<iostream>
#include<iomanip>
#include<stack>
#include<utility>
#include<unordered_map>
#include<queue>
#include<cstring>
#include <list>
#include<deque>
using namespace std;
const int maxn = 100000;
int sum[maxn];
void build(int p)
{
	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);
	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";
	}
}

解法二：

#include <vector>
#include <map>
#include<algorithm>
#include<cmath>
#include<set>
#include<cstdio>
#include <sstream>
#include <string>
#include<iostream>
#include<iomanip>
#include<stack>
#include<utility>
#include<unordered_map>
#include<queue>
#include<cstring>
#include <list>
#include<deque>
using namespace std;
map<int, int>cnt;
void createTree(int pos = 0)
{
	int v;
	scanf("%d", &v);
	if (v == -1)
		return;
	cnt[pos] += v;
	createTree(pos - 1);
	createTree(pos + 1);
}
int main()
{
	for (int i = 1;; ++i)
	{
		cnt.clear();
		createTree(0);
		if (cnt.size() == 0)
			break;
		printf("Case %d:\n", i);
		for (auto elem : cnt)
		{
			printf("%d%c", elem.second, elem.first == cnt.rbegin()->first ? '\n' : ' ');
		}
		puts("");
	}
}