hdoj1264_Counting Squares（线段树）

线段树求并面积，注意输入数据的坐标顺序

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

struct node{
    int l, r, f,clen;
};

struct seg{
    int l, r, h,f;
};

node nodes[100000];
vector<int> pos;
vector<seg> segs;

bool cmps(seg s1, seg s2)
{
    return s1.h > s2.h;
}

void init(int i,int l,int r)
{
    nodes[i].l = l;
    nodes[i].r = r;
    nodes[i].f = 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].f > 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(int i,seg s)
{
    if (s.l <= pos[nodes[i].l] && pos[nodes[i].r] <= s.r)
        nodes[i].f += s.f;
    else{
        int mid = (nodes[i].l + nodes[i].r) / 2;
        if (s.r <= pos[mid])
            update(i * 2, s);
        else if (s.l >= pos[mid])
            update(i * 2 + 1, s);
        else
        {
            update(i * 2, s);
            update(i * 2 + 1, s);
        }
    }
    getclen(i);
}

int main()
{
    while (1){
        int x1, y1, x2, y2;
        pos.clear();
        segs.clear();
        while (cin >> x1 >> y1 >> x2 >> y2){
            if ((x1 == -1 && x2 == -1) || (x1 == -2 && x2 == -2))
                break;
            pos.push_back(x1);
            pos.push_back(x2);
            if (x1 > x2)
            {
                int tx = x1;
                x1 = x2;
                x2 = tx;
            }
            if (y1 > y2)
            {
                int ty = y1;
                y1 = y2;
                y2 = ty;
            }
            segs.push_back(seg{x1,x2,y1,-1});
            segs.push_back(seg{x1,x2,y2,1});
        }
        sort(pos.begin(), pos.end());
        vector<int>::iterator j=unique(pos.begin(), pos.end());
        pos.erase( j,pos.end());
        init(1, 0, pos.size() - 1);
        sort(segs.begin(), segs.end(), cmps);
        int res = 0;
        for (int i = 0; i < segs.size(); i++)
        {
            if (i > 0)
                res += (segs[i-1].h - segs[i].h)*nodes[1].clen;
            update(1,segs[i]);
        }
        cout << res << endl;
        if (x1 == -2 && x2 == -2)
            break;
    }
    return 0;
}