UVa221 以后用区间覆盖问题解决

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<string>
#include<map>
#include<set>
#include<algorithm>
using namespace std;

const int MAX_INT=103;
struct building{
  int id;
  double x,y,w,h,d;
  bool operator < (const building& s) const{
	return x<s.x || (x==s.x&&y<s.y);
  }
}b[MAX_INT];
double que[2*MAX_INT];
int n;

bool cover (int i,double x)
{
  return (b[i].x<=x && b[i].x+b[i].w>=x);
}

bool Visible (int i,double x)//
{
  if (!cover (i,x))
	return false;
  for (int j=0;j<n;j++)
	if (cover (j,x) && b[j].y<b[i].y && b[j].h>=b[i].h )
	  return false;
  return true;
}

int main()
{
  int num=0;
  while (~scanf ("%d",&n)&&n)
  {
	if (num) printf ("\n");
	for (int i=0;i<n;i++){
	  scanf ("%lf%lf%lf%lf%lf",&b[i].x,&b[i].y,&b[i].w,&b[i].d,&b[i].h);
	  b[i].id=i+1;
	  que[i*2]=b[i].x;
	  que[i*2+1]=b[i].x+b[i].w;
	}
	sort (b,b+n);
	sort (que,que+n*2);
	int m=unique (que,que+n*2)-que; 
	printf ("For map #%d, the visible buildings are numbered as follows:\n%d",++num,b[0].id);
	for (int i=1;i<n;i++){
	  bool vis = false;
	  for (int j=0;j<m;j++){
		if ( Visible (i,(que[j]+que[j+1])/2) ){
		  vis = true;
		  break;
		}
	  }
	  if (vis)
		printf (" %d",b[i].id);
	}
	printf ("\n");
  }
  return 0;
}