uva699(根据先序还原树)

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int Readint(){
char c = getchar();
while(!isdigit(c)) c = getchar();
int x = 0;
while(isdigit(c)){
x = x * 10 + c - '0';
c = getchar();
}
return x;
}
int res[1010];
typedef struct node{
int t;
int val;
node* l,*r;
}node;
node* built(int p){
node *rt;
int x;
scanf("%d",&x);
if (x == -1) {
rt = NULL;
return rt;
}
res[p] += x;
rt = (node*)malloc(sizeof (node));
rt->val = x;
rt->l = built(p - 1);
rt->r = built(p + 1);
return rt;
}
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int icase = 0;
while(true){
node* root;
memset(res, 0,sizeof res);
root = built(500);
if (root == NULL) return 0;
vector<int> vec;
for (int i = 0;i < 1000;i++){
if (res[i]){
vec.push_back(res[i]);
}
}
printf("Case %d:\n",++icase);
for (int i = 0;i < vec.size();++i){
printf("%d%c",vec[i],(i == vec.size() - 1)?'\n':' ');
}
printf("\n");
}
return 0;
}