[Codevs] 矩形面积求并

http://codevs.cn/problem/3044/

线段树扫描线矩形面积求并

基本思路就是将每个矩形的长（平行于x轴的边）投影到线段树上

下边+1，上边-1；

然后根据线段树的权值和与相邻两条边的差值（高度差）求出相应的矩形面积

#include <bits/stdc++.h>

using namespace std;
const int N = ;

#define DB double

int F[N << ];
DB W[N << ], X[N];
struct Node {
    DB x_1, x_2, h; int how;
    Node() {};
    Node(DB x_1_, DB x_2_, DB h_, int how_) {x_1 = x_1_; x_2 = x_2_; h = h_; how = how_;}
}A[N];

bool cmp(Node a, Node b) {return a.h < b.h;}

inline int Find(DB num, int n) {
    int L = , R = n, Mid;
    while(L <= R) {
        Mid = (L + R) >> ;
        if(X[Mid] == num) return Mid;
        else if(X[Mid] < num) L = Mid + ;
        else R = Mid - ;
    }
}

#define lson jd << 1
#define rson jd << 1 | 1 

void Pushup(int jd, int l, int r) {
    if(F[jd]) W[jd] = X[r + ] - X[l];
    else if(l == r) W[jd] = ;
    else W[jd] = W[lson] + W[rson];
} 

void Sec_G(int l, int r, int jd, int x, int y, int yj) {
    if(x <= l && r <= y) {
        F[jd] += yj;
        Pushup(jd, l, r);
        return ;
    }
    int mid = (l + r) >> ;
    if(x <= mid) Sec_G(l, mid, lson, x, y, yj);
    if(y > mid)  Sec_G(mid + , r, rson, x, y, yj);
    Pushup(jd, l, r);
}

int main() {
    while() {
        int n;
        cin >> n;
        int js = ;
        if(!n) break;
        memset(F, , sizeof F);
        memset(W, , sizeof W);
        for(int i = ; i <= n; i ++) {
            DB x_1, x_2, y_1, y_2;
            scanf("%lf%lf%lf%lf", &x_1, &y_1, &x_2, &y_2);
            A[++ js] = Node(x_1, x_2, y_1, );
            X[js] = x_1;
            A[++ js] = Node(x_1, x_2, y_2, -);
            X[js] = x_2;
        }
        sort(X + , X + js + );
        sort(A + , A + js + , cmp);
        int k = ;
        for(int i = ; i <= js; i ++) if(X[i] != X[i + ]) X[++ k] = X[i];
        DB Answer = ;
        for(int i = ; i < js;  i ++) {
            int l = Find(A[i].x_1, k), r = Find(A[i].x_2, k) - ;
            Sec_G(, k, , l, r, A[i].how);
            Answer += W[] * (A[i + ].h - A[i].h);
        }
        printf("%.2lf\n", Answer);
    }
    return ;
}