hdu 3255 Farming (线段树扫描线球体积并)

把给出的权值看成是立方体的高，然后求出体积并。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define lson num<<1,s,mid
#define rson num<<1|1,mid+1,e
#define maxn 100005
using namespace std;
typedef long long LL;
struct node
{
    int x1,y1,z1;
    int x2,y2,z2;
}cube[maxn];

struct line
{
    int s,e,h,type;
    bool operator < (const line &cmp)const
    {
        return h<cmp.h;
    }
}scline[maxn<<1];
int price[10];
int x[maxn];
LL area[maxn<<2];
int cov[maxn<<2];
int tail;

void pushup(int num,int s,int e)
{
    if(cov[num])area[num]=x[e+1]-x[s];
    else if(s==e)area[num]=0;
    else area[num]=area[num<<1]+area[num<<1|1];
}
void build(int num,int s,int e)
{
    cov[num]=0;
    area[num]=0;
    if(s==e)return;
    int mid=(s+e)>>1;
    build(lson);
    build(rson);
}
void update(int num,int s,int e,int l,int r,int val)
{
    if(l<=s && r>=e)
    {
        cov[num]+=val;
        pushup(num,s,e);
        return;
    }
    int mid=(s+e)>>1;
    if(l<=mid)update(lson,l,r,val);
    if(r>mid)update(rson,l,r,val);
    pushup(num,s,e);
}

LL solve(int n,int m)
{
    LL ans=0;

    for(int z=0;z<m;z++)
    {
        int top=0;

        for(int i=1;i<=n;i++)
        if(cube[i].z1<=price[z] && cube[i].z2>price[z])
        {
            scline[top].s=cube[i].x1;
            scline[top].e=cube[i].x2;
            scline[top].h=cube[i].y1;
            scline[top++].type=1;
            scline[top].s=cube[i].x1;
            scline[top].e=cube[i].x2;
            scline[top].h=cube[i].y2;
            scline[top++].type=-1;
        }

        sort(scline,scline+top);
        build(1,0,tail);
        LL c=0;
        for(int i=0;i<top;i++)
        {
            int l=lower_bound(x,x+tail,scline[i].s)-x;
            int r=lower_bound(x,x+tail,scline[i].e)-x;
            if(l<r)update(1,0,tail,l,r-1,scline[i].type);
            c+=area[1]*(scline[i+1].h-scline[i].h);
        }
        ans+=c*(price[z+1]-price[z]);
    }
    return ans;
}
int main()
{
    int T;
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++)
    {
        int n,m;
        tail=0;

        scanf("%d%d",&n,&m);

        price[0]=0;

        for(int i=1;i<=m;i++)
            scanf("%d",&price[i]);
        for(int i=1;i<=n;i++)
        {
            int t;
            scanf("%d%d%d%d%d",&cube[i].x1,&cube[i].y1,&cube[i].x2,&cube[i].y2,&t);
            cube[i].z1=0;cube[i].z2=price[t];
            x[tail++]=cube[i].x1;
            x[tail++]=cube[i].x2;
        }
        sort(price,price+1+m);
        sort(x,x+tail);
        printf("Case %d: %I64d\n",cas,solve(n,m));
    }
    return 0;
}