P3415 祭坛

题意转化找一个上下左右最少点个数的最大值
二分一个答案，然后扫描线，处理好线上每个点上面有几个，下面有几个，怎么搞都行
每个x把y排序，便知道了左右的个数，用树状数组维护符合的点，修改掉改了的点。

#include <cstdio>
#include <vector>
#include<cstring>
#include <algorithm>
const int M=121000; std::vector<int>v[M];
int n,m,sum[M],a[M],b[M],last[M],l[M],r[M],up[M],down[M],cnt[M],ans;
int read(){
    int f=1,x=0;char ch;
    do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
    do{x=x*10+ch-'0';ch=getchar();}while(ch>='0'&&ch<='9');
    return f*x;
}
void add(int x,int t){for(;x<=n;x+=x&-x) sum[x]+=t;}
int query(int x){int ans=0;for(;x;x-=x&-x) ans+=sum[x];return ans;}
void solve(int x,int t){
    if(last[x]==t) return ;
    add(x,t?1:-1);last[x]=t;
}
int check(int x){
    memset(sum,0,sizeof sum);memset(last,0,sizeof last);
    memset(b,0,sizeof b);memset(a,0,sizeof a);ans=0;
    for(int i=1;i<=n;i++)   if(v[i].size()>=2*x)    l[i]=v[i][x-1]+1,r[i]=v[i][v[i].size()-x]-1;    else  l[i]=-1,r[i]=n+1;
    for(int i=1;i<=n;i++) up[i]=0,down[i]=cnt[i];
    for(int i=1;i<=n;i++) {std::vector<int>tmp;
        for(int j=0,y;j<v[i-1].size();j++){
            up[y=v[i-1][j]]++;tmp.push_back(y);
            if(up[y]>=x) a[y]=1;else a[y]=0;
        }
        for(int j=0,y;j<v[i].size();j++){
            down[y=v[i][j]]--;tmp.push_back(y);
            if(down[y]>=x) b[y]=1;else b[y]=0;
        }
        for(int j=0;j<tmp.size();j++)solve(tmp[j],(a[tmp[j]]+b[tmp[j]]==2));
        if(l[i]!=-1&&r[i]!=n+1) ans+=query(r[i])-query(l[i]-1);
    }
    return ans;
}
int main(){
    m=read();n=m+1;int l=0,r=n;
    for(int i=1,x,y;i<=m;i++) x=read(),y=read(),v[++x].push_back(++y),cnt[y]++;
    for(int i=1;i<=n;i++) sort(v[i].begin(),v[i].end());
    while(l<=r){int mid=(l+r)>>1;
        if(check(mid)) l=mid+1;else r=mid-1;
    }
    printf("%d\n%d",l-1,check(l-1));
}