CCPC－Wannafly & Comet OJ 夏季欢乐赛（2019） 茶颜悦色

https://www.cometoj.com/contest/59/problem/D 

思路：对y轴离散化；扫描x轴； 处理每个点对哪个区间有贡献；一旦x坐标超出k就是把贡献减掉；

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <map>
#include <set>
#include <stack>
using namespace std;

#define sfi(x) scanf("%d",&x)
#define sfc(x) scanf("%c",x)
#define sfl(x) scanf("%lld",&x)
#define sfs(x) scanf("%s",x)

#define rint register int
#define pb push_back
#define fl() printf("flag!\n")
#define INF 0x3f3f3f3f
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;

int vy[maxn];
int cnty=0;
int n,k;
int len;

struct Point
{
    int x,y,f;
    Point () {}
    Point (int _x,int _y,int _f)
    {
        x=_x;
        y=_y;
        f=_f;
    }
    bool operator < (const Point &b)const
    {
        if(x==b.x) return y<b.y;
        return x<b.x;
    }
}p[maxn];
int cnt;

struct node
{
    int Max;
    int lazy;
}tree[maxn<<2];

void pushup(int rt)
{
    tree[rt].Max=max(tree[rt<<1].Max,tree[rt<<1|1].Max);
}

void pushdown(int rt)
{
    if(tree[rt].lazy)
    {
        tree[rt<<1].lazy+=tree[rt].lazy;
        tree[rt<<1|1].lazy+=tree[rt].lazy;
        tree[rt<<1].Max+=tree[rt].lazy;
        tree[rt<<1|1].Max+=tree[rt].lazy;
        tree[rt].lazy=0;
    }
}

void build(int rt,int l,int r)
{
    tree[rt].Max=tree[rt].lazy=0;
    if(l==r) return ;
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
}

void update(int rt,int l,int r,int ql,int qr,int val)
{
    if(ql<=l&&qr>=r)
    {
        tree[rt].lazy+=val;
        tree[rt].Max+=val;
        return ;
    }
    pushdown(rt);
    int mid=(l+r)>>1;
    if(ql<=mid) update(rt<<1,l,mid,ql,qr,val);
    if(qr>mid) update(rt<<1|1,mid+1,r,ql,qr,val);
    pushup(rt);
}

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);


    cin>>n>>k;

    for(int i=1;i<=n;i++)
    {
        int x,y;
        cin>>x>>y;
        vy[cnty++]=y;
        vy[cnty++]=y+k;
        p[++cnt]=Point(x,y,1);
        p[++cnt]=Point(x+k+1,y,-1);
    }

    sort(vy,vy+cnty);

    len=unique(vy,vy+cnty)-vy;

    /*for(int i=0;i<len;i++)
    {
        cout<<vy[i]<<" ";
    }*/

    sort(p+1,p+1+cnt);

    int ans=0;

    build(1,1,len);
    for(int i=1;i<=cnt;i++)
    {
        int y1=lower_bound(vy,vy+len,p[i].y)-vy+1;
        int y2=lower_bound(vy,vy+len,p[i].y+k)-vy+1;

        //cout<<y1<<" "<<y2<<" "<<p[i].f<<endl;

        update(1,1,len,y1,y2,p[i].f);
        ans=max(ans,tree[1].Max);
    }

    cout<<ans<<endl;

    return 0;
}