uva221 疯狂r等待dl解答

#include<cstdio>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
struct re
{int num;
    double x,y,w,d,h;
    bool operator<(const re a)
    {
        if(y!=a.y)
            return y<a.y;
        else
            return x<a.x;
    }
};
re bui[110];
int ex[110];
int ans[110],k;
double hi;
int fin(double a,double b,int n)
{
    //printf("begin %d %d\n",a,b);
    for(int i=1; i<=n; i++)
    {
        int f=bui[i].x,g=bui[i].x+bui[i].w;
        if((f<=a&&g>=b)||f==a||g==b)
        {
            if(ex[i]==1)
                hi=max(bui[i].h,hi);
            if(ex[i]==0&&bui[i].h>hi)
            {
                ans[++k]=bui[i].num;
                ex[i]=1;
                hi=bui[i].h;
            }
        }
    }

}

int main(void)
{
    int n,i,time=0;
    int xji[300];
    while(scanf("%d",&n))
    {
        int d=0;
        if(n==0)break;
        memset(xji,0,sizeof(xji));
        memset(bui,0,sizeof(bui));
        memset(ex,0,sizeof(ex));
        memset(ans,0,sizeof(ans));
        k=0;
        for(i=1; i<=n; i++)
        {
            scanf("%lf%lf%lf%lf%lf",&bui[i].x,&bui[i].y,&bui[i].w,&bui[i].d,&bui[i].h);
            bui[i].num=i;
            xji[++d]=bui[i].x;
            xji[++d]=bui[i].x+bui[i].w;
        }
        sort(bui+1,bui+1+n);
        sort(xji+1,xji+d+1);
        int num_xji=unique(xji+1,xji+1+d)-(xji+1);

        for(i=2; i<=num_xji; i++)
        {
            hi=0;

            fin(xji[i-1],xji[i],n);
        }
        printf("For map #%d, the visible buildings are numbered as follows:\n",++time);
        for(i=1; ans[i]!=0; i++)
        {
            if(i!=1)
                printf(" ");
            printf("%d",ans[i]);
        }
        printf("\n");

    }
}