离散

划分空间，想到了话就很简单了。
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
struct Node
{
    double x,y,x1,y1;
}p[120];
double x[220],y[220];
int book[220][220];
int main()
{
    int n,kcase=1;
    while(scanf("%d",&n),n)
    {
         memset(book,0,sizeof(book));
         int numx=0,numy=0;
         for(int i=0;i<n;i++)
         {
             scanf("%lf%lf%lf%lf",&p[i].x,&p[i].y,&p[i].x1,&p[i].y1);
             x[numx++]=p[i].x;x[numx++]=p[i].x1;
             y[numy++]=p[i].y;y[numy++]=p[i].y1;
         }
         sort(x,x+numx);sort(y,y+numy);
         numx=unique(x,x+numx)-x;numy=unique(y,y+numy)-y;
          for(int i=0;i<n;i++)
          {
             int fromx=lower_bound(x,x+numx,p[i].x)-x;
             int tox=lower_bound(x,x+numx,p[i].x1)-x;
             int fromy=lower_bound(y,y+numy,p[i].y)-y;
             int toy=lower_bound(y,y+numy,p[i].y1)-y;
             for(int j=fromx;j<tox;j++)
              for(int k=fromy;k<toy;k++)
                 book[j][k]=1;
          }
          double ans=0;
          for(int i=0;i<numx-1;i++)
           for(int j=0;j<numy-1;j++)
             if(book[i][j])
             {
                 ans=ans+(x[i+1]-x[i])*(y[j+1]-y[j]);
             }
          printf("Test case #%d\nTotal explored area: %.2f\n\n",kcase++,ans);
    }
    return 0;
}