hdoj1542_Atlantis（线段树）

看了这篇后理解的：here

// hdoj1542_Atlantis.cpp : Defines the entry point for the console application.
// 线段树求并面积

#include<iostream>
#include<vector>
#include<iomanip>
#include<algorithm>
using namespace std;

struct segment{
    int f;
    double l, r, h;
};

struct node{
    int l, r, cov;
    double clen;
};

bool cmpseg(segment s1, segment s2)
{
    return s1.h > s2.h;
}

node nodes[1000];
vector<double> pos;
vector<segment> seg;

void init(int i, int l, int r)
{
    nodes[i].l = l;
    nodes[i].r = r;
    nodes[i].cov = 0;
    nodes[i].clen = 0;
    if (l+1 == r)
        return;
    else{
        int mid = (l + r) / 2;
        init(i * 2, l, mid);
        init(i * 2 + 1, mid, r);
    }
}

void getclen(int i)
{
    if (nodes[i].cov > 0)
        nodes[i].clen =pos[nodes[i].r] - pos[nodes[i].l];
    else if (nodes[i].l+1 == nodes[i].r)
        nodes[i].clen = 0;
    else
        nodes[i].clen = nodes[i*2].clen+nodes[i*2+1].clen;
}

void update(segment s, int i)
{
    if (s.l <= pos[nodes[i].l] && pos[nodes[i].r] <= s.r)
        nodes[i].cov += s.f;
    else
    {
        int mid = (nodes[i].l + nodes[i].r) / 2;
        if (s.r <= pos[mid])
            update(s, i * 2);
        else if (s.l >= pos[mid])
            update(s, i * 2 + 1);
        else
        {
            update(s, i * 2);
            update(s, i * 2 + 1);
        }
    }
    getclen(i);
}

int main(int argc, char* argv[])
{
    int n;
    int t = 1;
    while (cin >> n&&n)
    {
        pos.clear();
        seg.clear();
        for (int i = 0; i < n; i++)
        {
            double x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;
            pos.push_back(x1);
            pos.push_back(x2);
            seg.push_back(segment{-1,x1,x2,y1});
            seg.push_back(segment{ 1, x1, x2, y2 });
            sort(pos.begin(), pos.end());
            vector<double>::iterator j=unique(pos.begin(), pos.end());
            pos.erase(j, pos.end());
            sort(seg.begin(), seg.end(),cmpseg);
        }
        init(1, 0, pos.size() - 1);
        double ans = 0;
        for (int i = 0; i < seg.size(); i++)
        {
            if (i>0)
                ans += (seg[i-1].h - seg[i].h)*nodes[1].clen;
            update(seg[i],1);
        }

        cout << "Test case #" << t++ << endl;
        cout << "Total explored area: " << setiosflags(ios::fixed) << setprecision(2) << ans << endl << endl;
    }
    return 0;
}