uva 699

题意：求同一垂直线的和，数组模拟，递归模拟这个过程

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 110;

int a[MAXN];

void dfs(int mid,int n,int *a)
{
    if ( n != -1)
    {
        a[mid] += n ;
        scanf("%d",&n);
        dfs(mid-1,n,a);
        scanf("%d",&n);
        dfs(mid+1,n,a);
    }
}

int main()
{
    int i,j,mid,cnt=1;
    int left,right,n;
    while (scanf("%d",&n) != EOF && n >= 0)
    {
        memset(a,0,sizeof(a));
        mid = 50 ;
        dfs(mid,n,a);
        printf("Case %d:\n",cnt++);

        left = 0 ,right = MAXN;
        while (!a[left])
            left++;
        while (!a[right])
            right--;

        for ( i = left ; i <= right ; i++)
        {
            printf("%d",a[i]);
            if (i != right)
                printf(" ");
        }
        printf("\n\n");
    }
    return 0;
}