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

#include
#include
#include
#include
#include
#include
#include
#include
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=x);
}

bool Visible (int i,double x)//
{
  if (!cover (i,x))
	return false;
  for (int j=0;j=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

你可能感兴趣的:(STL学习)