AC日记——[Scoi2010]序列操作 bzoj 1858

1858

思路：

　　恶心；

代码：

#include <bits/stdc++.h>
using namespace std;
#define maxn 100005
struct TreeNodeType {
    int l,r,l1,r1,m1,l0,r0,m0,mid,size,cnt1,cnt0;
    bool f1,f0,ff;
    inline void turn(){swap(l1,l0),swap(r1,r0),swap(m1,m0),swap(cnt1,cnt0);}
    inline void turn1(){l0=,r0=,m0=,cnt0=,l1=size,r1=size,m1=size,cnt1=size;}
    inline void turn0(){l1=,r1=,m1=,cnt1=,l0=size,r0=size,m0=size,cnt0=size;}
    inline void F1(){f1=true,f0=false,ff=false;}
    inline void F0(){f0=true,f1=false,ff=false;}
    inline void FF(){
        if(f1) f0=true,f1=false;
        else if(f0) f1=true,f0=false;
        else ff^=;
    }
    inline void turnzero(){f1=false,f0=false,ff=false;}
};
struct TreeNodeType tree[maxn<<];
struct AnsType {
    int l,r,m,s;
};
int n,m,Count;
inline void in(int &now)
{
    char Cget=getchar();now=;
    while(Cget>''||Cget<'') Cget=getchar();
    while(Cget>=''&&Cget<='') now=now*+Cget-'',Cget=getchar();
}
inline void updata(int now)
{
    tree[now].cnt1=tree[now<<].cnt1+tree[now<<|].cnt1;
    tree[now].cnt0=tree[now<<].cnt0+tree[now<<|].cnt0;
    tree[now].l1=tree[now<<].size==tree[now<<].l1?tree[now<<].l1+tree[now<<|].l1:tree[now<<].l1;
    tree[now].l0=tree[now<<].size==tree[now<<].l0?tree[now<<].l0+tree[now<<|].l0:tree[now<<].l0;
    tree[now].r1=tree[now<<|].size==tree[now<<|].r1?tree[now<<|].r1+tree[now<<].r1:tree[now<<|].r1;
    tree[now].r0=tree[now<<|].size==tree[now<<|].r0?tree[now<<|].r0+tree[now<<].r0:tree[now<<|].r0;
    tree[now].m1=max(tree[now<<].r1+tree[now<<|].l1,max(tree[now<<].m1,tree[now<<|].m1));
    tree[now].m0=max(tree[now<<].r0+tree[now<<|].l0,max(tree[now<<].m0,tree[now<<|].m0));
}
inline void downdata(int now)
{
    if(tree[now].f1) tree[now<<].turn1(),tree[now<<|].turn1(),tree[now<<].F1(),tree[now<<|].F1();
    if(tree[now].f0) tree[now<<].turn0(),tree[now<<|].turn0(),tree[now<<].F0(),tree[now<<|].F0();
    if(tree[now].ff) tree[now<<].turn(),tree[now<<|].turn(),tree[now<<].FF(),tree[now<<|].FF();
    tree[now].turnzero();
}
inline void build(int now,int l,int r)
{
    tree[now].l=l,tree[now].r=r,tree[now].size=r-l+;
    if(l==r)
    {
        int pos;
        in(pos);
        if(pos) tree[now].l1=,tree[now].r1=,tree[now].m1=,tree[now].cnt1=;
        else tree[now].l0=,tree[now].r0=,tree[now].m0=,tree[now].cnt0=;
        return;
    }
    tree[now].mid=l+r>>;
    build(now<<,l,tree[now].mid);
    build(now<<|,tree[now].mid+,r);
    updata(now);
}
inline void operation0(int now,int l,int r)
{
    if(tree[now].l>=l&&tree[now].r<=r){tree[now].turn0(),tree[now].F0();return;}
    if(tree[now].f1||tree[now].f0||tree[now].ff) downdata(now);
    if(l<=tree[now].mid) operation0(now<<,l,min(r,tree[now].mid));
    if(r>tree[now].mid) operation0(now<<|,max(tree[now].mid+,l),r);
    updata(now);
}
inline void operation1(int now,int l,int r)
{
    if(tree[now].l>=l&&tree[now].r<=r){tree[now].turn1(),tree[now].F1();return;}
    if(tree[now].f1||tree[now].f0||tree[now].ff) downdata(now);
    if(l<=tree[now].mid) operation1(now<<,l,min(r,tree[now].mid));
    if(r>tree[now].mid) operation1(now<<|,max(tree[now].mid+,l),r);
    updata(now);
}
inline void operation2(int now,int l,int r)
{
    if(tree[now].l>=l&&tree[now].r<=r){tree[now].turn(),tree[now].FF();return;}
    if(tree[now].f1||tree[now].f0||tree[now].ff) downdata(now);
    if(l<=tree[now].mid) operation2(now<<,l,min(r,tree[now].mid));
    if(r>tree[now].mid) operation2(now<<|,max(tree[now].mid+,l),r);
    updata(now);
}
inline void operation3(int now,int l,int r)
{
    if(tree[now].l>=l&&tree[now].r<=r){Count+=tree[now].cnt1;return;}
    if(tree[now].f1||tree[now].f0||tree[now].ff) downdata(now);
    if(l<=tree[now].mid) operation3(now<<,l,min(r,tree[now].mid));
    if(r>tree[now].mid) operation3(now<<|,max(l,tree[now].mid+),r);
    updata(now);
}
inline AnsType operation4(int now,int l,int r)
{
    if(tree[now].l>=l&&tree[now].r<=r) return (AnsType){tree[now].l1,tree[now].r1,tree[now].m1,tree[now].size};
    if(tree[now].f1||tree[now].f0||tree[now].ff) downdata(now);
    bool al=false,ar=false;AnsType Al,Ar,res;
    if(l<=tree[now].mid) al=true,Al=operation4(now<<,l,min(r,tree[now].mid));
    if(r>tree[now].mid) ar=true,Ar=operation4(now<<|,max(l,tree[now].mid+),r);
    if(al&&ar)
    {
        res.s=Al.s+Ar.s;
        res.l=Al.s==Al.l?Al.l+Ar.l:Al.l;
        res.r=Ar.s==Ar.r?Ar.r+Al.r:Ar.r;
        res.m=max(Al.r+Ar.l,max(Al.m,Ar.m));
        return res;
    }
    return al?Al:Ar;
}
int main()
{
    in(n),in(m),build(,,n-);
    int op,l,r;AnsType pos;
    while(m--)
    {
        in(op),in(l),in(r);
        if(op==) operation0(,l,r);
        if(op==) operation1(,l,r);
        if(op==) operation2(,l,r);
        if(op==) Count=,operation3(,l,r),printf("%d\n",Count);
        if(op==) pos=operation4(,l,r),printf("%d\n",max(max(pos.l,pos.r),pos.m));
    }
    return ;
}