【线段树扫描线加双指针】无法交的题

输入
13 5 8
8 4 10 4
4 3 4 4
10 2 12 2
8 2 8 4
2 4 6 4
10 3 10 4
12 3 12 4
2 2 4 2

输出
3

备注
【数据范围】
对于 30% 的数据，p≤1000。
对于 70% 的数据，p≤30000。
对于 100% 的数据，p≤400000；m,n≤1000000。

做法 我们首先以横坐标方向建在每个横坐标建立一颗存最长连续0长度的线段树
矩形的左边我们添加
矩形的右边我们删除
然后我们从左往右用双指针扫 能组成的正方形边长最小值 就是 min(r-l+1,ms[1])
如果 ms[1]<r-l+1 那么我们就需要向右边移动 l 所以跑一边双指针即可

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 1000025;
int ms[MAX_N<<2],ls[MAX_N<<2],rs[MAX_N<<2],col[MAX_N<<2];
int Max(int a,int b){if(a>b) return a;return b;}
vector<int > add[MAX_N/2],del[MAX_N/2];
int x[2][MAX_N/2],y[2][MAX_N/2];
void up(int rt,int l,int r)
{
    if(col[rt]) {ms[rt] = ls[rt] = rs[rt] = 0;return ;}
    if(l==r) {ms[rt] = ls[rt] = rs[rt] = 1;return ;}
    ls[rt] = ls[rt<<1] + (ls[rt<<1]==(mid-l+1)?ls[rt<<1|1]:0);
    rs[rt] = rs[rt<<1|1] + (rs[rt<<1|1] == (r-mid)?rs[rt<<1]:0);
    ms[rt] = Max(rs[rt<<1]+ls[rt<<1|1],Max(ms[rt<<1],ms[rt<<1|1]));
}
void build(int rt,int l,int r)
{
    ms[rt] = ls[rt] = rs[rt] = r-l+1,col[rt] = 0;
    if(l==r)
    {
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
}
void update(int rt,int l,int r,int x,int y,int v)
{
    if(x<=l&&r<=y)
    {
        col[rt]+=v;
        up(rt,l,r);
        return ;
    }
    if(x<=rt) update(rt<<1,l,mid,x,y,v);
    if(mid<y) update(rt<<1|1,mid+1,r,x,y,v);
    up(rt,l,r);
}
int query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        return ms[rt];
    }
    int maxx1 = 0,maxx2 = 0;
    if(x<=mid) maxx1 = query(rt<<1,l,mid,x,y);
    if(mid<y) maxx2 = query(rt<<1|1,mid+1,r,x,y);
    return Max(maxx1,maxx2);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,p;
    scanf("%d%d%d",&n,&m,&p);
    for(int i = 1;i<=p;++i)
    {
        scanf("%d%d%d%d",&x[0][i],&y[0][i],&x[1][i],&y[1][i]);
        add[x[0][i]].push_back(i);
        del[x[1][i]].push_back(i);
    }
    build(1,1,m);
    int l = 1,r = 1,ans = 0;
    while(r<=n)
    {
        for(int it = 0;it<add[r].size();it++)
            update(1,1,m,y[0][add[r][it]],y[1][add[r][it]],1);
        ans = max(ans,min(ms[1],r-l+1));
        while(ms[1]<r-l+1)
        {
            for(int it = 0;it<del[l].size();++it)
                update(1,1,m,y[0][del[l][it]],y[1][del[l][it]],-1);
            l++;
        }
        r++;
    }
    printf("%d\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}