poj 3277 线段树求区间并1

所有矩形有相同的下边界，求 并 的面积

#include <stdio.h>
#include <algorithm>

using namespace std;
#define N 80001
#define L(i) i<<1
#define R(i) i<<1|1
struct City
{
    __int64 l,r,h;
    void input()
    {
        scanf("%I64d%I64d%I64d",&l,&r,&h);
    }
}building[N];
struct node{
    int l,r;
    __int64 h;
    int mid()
    {
        return (l + r)>>1;
    }
}st[N<<2];

bool cmp(City a,City b)
{
    return a.h < b.h;
}
int n,top;
__int64 hash[N];
__int64 sum;

int bs(__int64 s)
{
    int mid,l = 0, r = top -1;
    while(l <= r)
    {
        mid = (l + r)>>1;
        if(hash[mid] == s)
            return mid;
        if(hash[mid] &l