uva 699

算每一列的和，读入时要用到性质n2=n0-1来判断一组数据的结束

#include<stdio.h>

#include<string.h>
#include<stdlib.h>
struct node{
int d;
int pos;
node *lchild;
node *rchild;
} e;
int leaf[170];int j,n;
node* build(node* p,int* str,int w)
{
j++;
if(j>=n)
return NULL;
if(str[j]!=-1)
{
p=new node;
p->lchild=NULL;
p->rchild=NULL;
p->d=str[j];
p->pos=w;
p->lchild=build(p,str,w-1);
p->rchild=build(p,str,w+1);
return p;
}
else if(str[j]==-1)
return NULL;
}
void count(node *p)
{
if(p==NULL)
return;
else
{
int w=p->pos;
leaf[w]+=p->d;
count(p->lchild);
count(p->rchild);
}
}
int find(int b[])
{
int i=0;
for(i=0;i<170;i++)
{
if(b[i]!=0)
break;
}
return i;
}
int a[100000];
int main()
{
int i,f,k;
char ch;i=0;k=1;
node *root;
int n2=1,n0=0;
while(scanf("%d%c",&a[i++],&ch)==2)
{
if(a[0]==-1&&ch=='\n')
break;
if(a[i-1]==-1)
n0++;
else if(a[i-1]!=-1) 
n2++;
if(n2==n0)
{
j=-1;n=i;
memset(leaf,0,sizeof(leaf));
root=build(root,a,85);
count(root);
f=find(leaf);
//if(k!=1)
// printf("\n");
printf("Case %d:\n%d",k++,leaf[f]);
for(i=f+1;;i++)
{
if(leaf[i]!=0)
printf(" %d",leaf[i]);
else 
break;
}
printf("\n");printf("\n");
i=0;
n2=1;n0=0;
}
}
return 0;
}