E - The Falling Leaves

https://vjudge.net/contest/279738#problem/E

#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
int i,j,k,l,x,kk,d[100000],ans[1000000];
map<int,int>m;
void dfs(int xx)
{
    int x;
    scanf("%d",&x);
    if (x!=-1)
    {
        m[xx]+=x;
        dfs(xx-1);
        dfs(xx+1);
    }
}
int main()
{
    while (scanf("%d",&x))
    {
        if (x==-1) break;
        m.clear();
        m[1]=x;
        dfs(0);
        dfs(2);
        int ff=1;
        kk++;
        printf("Case %d:\n",kk);
        for (map<int,int>::iterator it=m.begin(); it!=m.end(); it++)
        {
            if (ff==0) printf(" %d",it->second);
            else printf("%d",it->second);
            ff=0;
        }

        printf("\n\n");
    }
}