hdu 1828线段树扫描线求周长并

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<sstream>
#include<string>
#include<climits>
#include<stack>
#include<set>
#include<bitset>
#include<cmath>
#include<deque>
#include<map>
#include<queue>
#define iinf 2000000000
#define linf 1000000000000000000LL
#define dinf 1e200
#define eps 1e-5
#define all(v) (v).begin(),(v).end()
#define sz(x)  x.size()
#define pb push_back
#define mp make_pair
#define lng long long
#define sqr(a) ((a)*(a))
#define pii pair<int,int>
#define pll pair<lng,lng>
#define pss pair<string,string>
#define pdd pair<double,double>
#define X first
#define Y second
#define pi 3.14159265359
#define ff(i,xi,n) for(int i=xi;i<=(int)(n);++i)
#define ffd(i,xi,n) for(int i=xi;i>=(int)(n);--i)
#define ffl(i,r) for(int i=head[r];i!=-1;i=edge[i].next)
#define cc(i,j) memset(i,j,sizeof(i))
#define two(x)			((lng)1<<(x))
#define N 22222
#define M 1000000
#define lson l , mid , rt << 1
#define rson mid + 1 , r , rt << 1 | 1
#define Mod  n
#define Pmod(x) (x%Mod+Mod)%Mod
using namespace std;
typedef vector<int>  vi;
typedef vector<string>  vs;
typedef unsigned int uint;
typedef unsigned lng ulng;
template<class T> inline void checkmax(T &x,T y){if(x<y) x=y;}
template<class T> inline void checkmin(T &x,T y){if(x>y) x=y;}
template<class T> inline T Min(T x,T y){return (x>y?y:x);}
template<class T> inline T Max(T x,T y){return (x<y?y:x);}
template<class T> T gcd(T a,T  b){return (a%b)==0?b:gcd(b,a%b);}
template<class T> T lcm(T a,T b){return a*b/gcd(a,b);}
template<class T> T Abs(T a){return a>0?a:(-a);}
template<class T> inline T lowbit(T n){return (n^(n-1))&n;}
template<class T> inline int countbit(T n){return (n==0)?0:(1+countbit(n&(n-1)));}
template<class T> inline bool isPrimeNumber(T n)
{if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}
int le[N<<2],ri[N<<2],len[N<<2],num[N<<2],cnt[N<<2],n;
struct ps
{
    int l,r,h;
    int x;
    ps(int _l=0,int _r=0,int _h=0,int xx=0):l(_l),r(_r),h(_h),x(xx){}
}a[N*2];
bool cmp(ps p,ps q)
{
    return p.h<q.h||(p.h==q.h&&p.x>q.x);
}
inline void pushup(int rt,int l,int r)
{
    if(cnt[rt])
    {
        len[rt]=r-l+1;
        num[rt]=2;
        le[rt]=ri[rt]=1;
    }
    else
    if(l==r) len[rt]=num[rt]=le[rt]=ri[rt]=0;
    else
    {
        len[rt]=len[rt<<1]+len[rt<<1|1];
        num[rt]=num[rt<<1]+num[rt<<1|1];
         le[rt]=le[rt<<1],ri[rt]=ri[rt<<1|1];
         if(ri[rt<<1]&&le[rt<<1|1]) num[rt]-=2;
    }
}
void update(int L,int R,int c,int l,int r,int rt)
{
    if(L<=l&&r<=R)
    {
        cnt[rt]+=c;
        pushup(rt,l,r);
        return;
    }
    int mid=(l+r)>>1;
    if(L<=mid) update(L,R,c,lson);
    if(R>mid) update(L,R,c,rson);
    pushup(rt,l,r);
}
int main()
{
    while(scanf("%d",&n)==1)
    {
        cc(le,0);
        cc(ri,0);
        cc(num,0);
        cc(len,0);
        cc(cnt,0);
        int ma=-iinf,mi=iinf;
        ff(i,1,n)
        {
            int x1,x2,y1,y2;
            scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
            checkmax(ma,x2);
            checkmin(mi,x1);
            a[2*i-1]=ps(x1,x2,y1,1);
            a[2*i]=ps(x1,x2,y2,-1);
        }
        sort(a+1,a+1+2*n,cmp);
        int ans=0,pre=0;
        ff(i,1,2*n-1)
        {
            update(a[i].l,a[i].r-1,a[i].x,mi,ma,1);
            ans+=Abs(len[1]-pre);
            pre=len[1];
            ans+=num[1]*(a[i+1].h-a[i].h);
        }
        ans+=len[1];
        printf("%d\n",ans);
    }

    return 0;
}