zoj 1128

传说中的线段树 传说中的离散化  传说中的矩形并  线段树的东西没看过 不过代码还是看懂了  就是线性扫描一下  map[][] 的功能就像是缩点一样  告诉你哪一块是有用的

照着别人代码巧了2个小时不知道哪错了  真是  哎 …………

# include <stdio.h>
# include <algorithm>
# include <string.h>
# include <stdlib.h>
# include <math.h>
using namespace std;
double x[209];
double y[209];
int map[209][209];
const double eps = 1e-6;
bool dy(double x,double y)	{	return x > y + eps;}	// x > y
bool xy(double x,double y)	{	return x < y - eps;}	// x < y
bool dyd(double x,double y)	{ 	return x > y - eps;}	// x >= y
bool xyd(double x,double y)	{	return x < y + eps;} 	// x <= y
bool dd(double x,double y) 	{	return fabs( x - y ) < eps;}  // x == y
struct node
{
    double lx,ly,rx,ry;
}r[209];
int find(double p,int m,double a[])
{
    int beg=0,end=m-1;
    int mid;
    while(beg<=end)
    {
        mid=(beg+end)>>1;
        if(dd(p,a[mid]))
            return mid;
        if(dy(p,a[mid]))
            beg=mid+1;
        else  end=mid;
    }
}
double area(int n,int m)
{
    for(int i=0;i<n;i++)
    {
        int x1=find(r[i].lx,m,x);
        int x2=find(r[i].rx,m,x);
        int y1=find(r[i].ly,m,y);
        int y2=find(r[i].ry,m,y);
        for(int j=x1;j<x2;j++)
            for(int k=y1;k<y2;k++)
                map[j][k]=true;
    }
    double sum=0;
    for(int i=0;i<m-1;i++)
        for(int j=0;j<m-1;j++)
        if(map[i][j])
        sum+=(x[i+1]-x[i])*(y[j+1]-y[j]);
    return sum;
}
int main()
{
    int n;
    int cas=1;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0) break;
        memset(map,0,sizeof(map));
        int cnt=0;
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf%lf%lf",&r[i].lx,&r[i].ly,&r[i].rx,&r[i].ry);
            x[cnt]=r[i].lx;
            y[cnt++]=r[i].ly;
            x[cnt]=r[i].rx;
            y[cnt++]=r[i].ry;
        }
        sort(x,x+cnt);
        sort(y,y+cnt);
        double ans=area(n,cnt);

        printf("Test case #%d\nTotal explored area: %.2lf\n\n",cas++,ans);
    }
    return 0;
}