2014 UESTC Training for Data Structures D - 长使英雄泪满襟

#include <iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
using namespace std;

struct node{
    int left;
    int right;
    int data;
    int lazy;
}shu[200005];
int n,W,H;
struct mmmm{
    int x;
    int y;
    int w;
    bool real;
    int len;
}xin[200005];
bool cmpy(const mmmm &j,const mmmm &k)
{
    if (j.y!=k.y) return (j.y<k.y);
    else return (j.x<k.x);
}
bool cmpx(const mmmm &j,const mmmm &k)
{
    if (j.x!=k.x) return (j.x<k.x);
    else return (j.real>k.real);
}
void jian(int j,int g,int h)
{
    shu[j].left=g;shu[j].right=h;
    if (g==h) return;
    jian(j*2,g,(g+h)/2);
    jian(j*2+1,(g+h)/2+1,h);
}
void push_down(int l)
{
    if (shu[l].lazy!=0){
        shu[l*2].lazy+=shu[l].lazy;
        shu[l*2+1].lazy+=shu[l].lazy;
        shu[l*2].data+=shu[l].lazy;
        shu[l*2+1].data+=shu[l].lazy;
        shu[l].lazy=0;
    }
    return;
}
void inside(int g,int h,int l,int light)
{
    bool b=false;
        if (shu[l].left==shu[l].right) {shu[l].data+=light;return ;}
        if (shu[l].left==g && shu[l].right==h) {shu[l].lazy+=light;shu[l].data+=light;return ;}
        push_down(l);
        if (g>(shu[l].left+shu[l].right)/2) {inside(g,h,l*2+1,light);b=true;}
        if (h<=(shu[l].left+shu[l].right)/2) {inside(g,h,l*2,light);b=true;}
        if (!b) {
            inside(g,(shu[l].left+shu[l].right)/2,l*2,light);
            inside((shu[l].left+shu[l].right)/2+1,h,l*2+1,light);
        }
        shu[l].data=max(shu[l*2].data,shu[l*2+1].data);
}

int main()
{
    memset(shu,0,sizeof(shu));
    memset(xin,0,sizeof(xin));
    cin>>n>>W>>H;
    int g,h,j,l;
    for (j=0;j<n;j++) scanf("%d%d%d",&xin[j].x,&xin[j].y,&xin[j].w);
    sort(xin,xin+n,cmpy);
    h=1;g=0;
    while (g<n){
        while (g<n && xin[g].y==xin[g+1].y) {
            xin[g].len=h;
            g++;
        }
        xin[g].len=h;
        h++;g++;
    }
    g=0;
    for (j=0;j<n;j++){
        while (g<n && xin[j].y+H>xin[g].y) g++;
        g--;
        xin[j].y=xin[j].len;
        xin[j].len=xin[g].len-xin[j].len+1;
    }
    h=xin[n-1].y;
    for (j=0;j<n;j++){
        xin[j].real=true;
        xin[j+n].x=xin[j].x-W;
        xin[j+n].y=xin[j].y;
        xin[j+n].w=xin[j].w;
        xin[j+n].real=false;
        xin[j+n].len=xin[j].len;
    }
    sort(xin,xin+2*n,cmpx);
    jian(1,1,h);
    int max=-1;
    for (j=0;j<2*n;j++){
        if (xin[j].real) l=-1;else l=1;
        inside(xin[j].y,xin[j].y+xin[j].len-1,1,l*xin[j].w);
        if (shu[1].data>max) max=shu[1].data;
    }
    cout<<max<<endl;
    return 0;
}