POJ Area of Simple Polygons 扫描线

这个题lba等神犇说可以不用离散化，但是我就是要用。

题干：

Description

There are N,  <= N <= , rectangles in the -D xy-plane. The four sides of a rectangle are horizontal or vertical line segments. Rectangles are defined by their lower-left and upper-right corner points. Each corner point is a pair of two nonnegative integers in the range of  through , indicating its x and y coordinates. 

Assume that the contour of their union is defi ned by a set S of segments. We can use a subset of S to construct simple polygon(s). Please report the total area of the polygon(s) constructed by the subset of S. The area should be as large as possible. In a -D xy-plane, a polygon is defined by a finite set of segments such that every segment extreme (or endpoint) is shared by exactly two edges and no subsets of edges has the same property. The segments are edges and their extremes are the vertices of the polygon. A polygon is simple if there is no pair of nonconsecutive edges sharing a point. 

Example: Consider the following three rectangles: 

rectangle : < (, ) (, ) >, 

rectangle : < (, ) (, ) >, 

rectangle : < (, ) (, ) >. 

The total area of all simple polygons constructed by these rectangles is .
Input

The input consists of multiple test cases. A line of  -'s separates each test case. An extra line of 4 -1's marks the end of the input. In each test case, the rectangles are given one by one in a line. In each line for a rectangle,  non-negative integers are given. The first two are the x and y coordinates of the lower-left corner. The next two are the x and y coordinates of the upper-right corner.
Output
For each test case, output the total area of all simple polygons in a line.
Sample Input

- - - -

- - - -
- - - -　
Sample Output

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
using namespace std;
#define duke(i,a,n) for(int i = a;i <= n;i++)
#define lv(i,a,n) for(int i = a;i >= n;i--)
#define clean(a) memset(a,0,sizeof(a))
const int INF =  << ;
const int mod = ;
typedef double db;
template <class T>
void read(T &x)
{
    char c;
    bool op = ;
    while(c = getchar(), c < '' || c > '')
        if(c == '-') op = ;
    x = c - '';
    while(c = getchar(), c >= '' && c <= '')
        {x = x *  + c - '';if(x > mod) x %= mod;}
    if(op) x = -x;
}
template <class T>
void write(T x)
{
    if(x < ) putchar('-'), x = -x;
    if(x >= ) write(x / );
    putchar('' + x % );
}
struct node
{
    int s,e,h,f;
}p[];
int n,m,ans;
int tree[],x[];
int c[];
void init()
{
    n = m = ans = ;
    clean(tree);
    clean(p);
    clean(c);
    x[] = -;
}
bool cmp(node a,node b)
{
    return a.h < b.h;
}

void push_up(int o,int l,int r)
{
    // printf("@%d %d\n",l,r);
    if(c[o] != ) tree[o] = x[r+] - x[l];
    else if(l == r) tree[o] = ;
    else tree[o] = tree[o << ] + tree[o <<  | ];
}

void update(int o,int l,int r,int x,int y,int w)
{
    if(l == x && r == y) c[o] += w;
    else
    {
        int mid = (l + r) >> ;
        if(y <= mid) update(o << ,l,mid,x,y,w);
        else if(x > mid) update(o <<  | ,mid + ,r,x,y,w);
        else update(o << ,l,mid,x,mid,w),update(o <<  | ,mid + ,r,mid + ,y,w);
    }
    push_up(o,l,r);
}
int main()
{
    int a,b,c,d;
    init();
    while(scanf("%d%d%d%d",&a,&b,&c,&d) != EOF)
    {
        if(a < )
        break;
        while(a >= )
        {
            p[++n].s = a;p[n].e = c;p[n].h = b;p[n].f = ;
            x[n] = a;
            p[++n].s = a;p[n].e = c;p[n].h = d;p[n].f = -;
            x[n] = c;
            read(a);read(b);read(c);read(d);
        }
        sort(x + ,x + n + );
        m = unique(x + ,x + n + ) - x - ;
        sort(p + ,p + n + ,cmp);
        duke(i,,n-)
        {
            int l = lower_bound(x,x + m,p[i].s) - x;
            int r = lower_bound(x,x + m,p[i].e) - x - ;
            update(,,m,l,r,p[i].f);
            ans += tree[] * (p[i + ].h - p[i].h);
        }
        printf("%d\n",ans);
        init();
    }
    return ;
}