hdu3397 线段树综合

初看，发现题目很很熟悉，很兴奋啊。总算有个容易点的题目了。很顺利的敲完了，后来发现pushdown完全错了，然后改了一下，过了测试，交上去超时了。当时想，以为是query只写一个的原因，又写了个询问，结果还是超时。去网上查了一下，发现有人用这个思路过了，但是就郁闷了，后来队友发现了一个小错误，居然在更新时把R>m写成r>m，总算有惊无险的过了。

思路：记录左中右0、1连续成段更新，注意细节就好了。

ACcode：

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

const int size=111111;

struct Node
{
    int lc,mc,rc;
    int lz,mz,rz;
    int sum,lazy;
    int xr,len;
} tre[size<<2];

struct Segtree
{
    int Max(int a1,int a2)
    {
        return a1>a2?a1:a2;
    }

    void pushup(int rt,int k)
    {
        int r1=rt<<1,r2=r1|1;
        int rs=k>>1,ls=k-(k>>1);
        tre[rt].sum=tre[r1].sum+tre[r2].sum;
        if (tre[r1].lc==ls) tre[rt].lc=tre[r1].lc+tre[r2].lc;
        else  tre[rt].lc=tre[r1].lc;
        if (tre[r2].rc==rs) tre[rt].rc=tre[r1].rc+tre[r2].rc;
        else tre[rt].rc=tre[r2].rc;
        tre[rt].mc=Max(tre[r1].rc+tre[r2].lc,Max(tre[r1].mc,tre[r2].mc));
        if (tre[r1].lz==ls) tre[rt].lz=tre[r1].lz+tre[r2].lz;
        else  tre[rt].lz=tre[r1].lz;
        if (tre[r2].rz==rs) tre[rt].rz=tre[r1].rz+tre[r2].rz;
        else tre[rt].rz=tre[r2].rz;
        tre[rt].mz=Max(tre[r1].rz+tre[r2].lz,Max(tre[r1].mz,tre[r2].mz));
    }

    void build(int rt,int l,int r)
    {
        tre[rt].lazy=-1;
        tre[rt].xr=0;
        tre[rt].len=r-l+1;
        if (l==r)
        {
            int v;
            scanf("%d",&v);
            tre[rt].lc=tre[rt].mc=tre[rt].rc=tre[rt].sum=v;
            tre[rt].lz=tre[rt].mz=tre[rt].rz=(v?0:1);
            return ;
        }
        int m=(l+r)>>1;
        build(rt<<1,l,m);
        build(rt<<1|1,m+1,r);
        pushup(rt,r-l+1);
    }

    void change(int rt)
    {
        int t;
        t=tre[rt].lc;
        tre[rt].lc=tre[rt].lz;
        tre[rt].lz=t;
        t=tre[rt].mc;
        tre[rt].mc=tre[rt].mz;
        tre[rt].mz=t;
        t=tre[rt].rc;
        tre[rt].rc=tre[rt].rz;
        tre[rt].rz=t;
    }

    void Txor(int rt)
    {
        if (tre[rt].lazy>=0) tre[rt].lazy=1-tre[rt].lazy;
        else tre[rt].xr^=1;
    }

    void pushdown(int rt,int k)
    {
        int v=tre[rt].lazy;
        int r1=rt<<1,r2=r1|1;
        int ls=k-(k>>1),rs=k>>1;
        if (v!=-1)
        {
            tre[r1].lc=tre[r1].mc=tre[r1].rc=tre[r1].sum=(v?ls:0);
            tre[r1].lz=tre[r1].mz=tre[r1].rz=(v?0:ls);
            tre[r2].lc=tre[r2].mc=tre[r2].rc=tre[r2].sum=(v?rs:0);
            tre[r2].lz=tre[r2].mz=tre[r2].rz=(v?0:rs);
            tre[r1].xr=tre[r2].xr=0;
            tre[r1].lazy=tre[r2].lazy=tre[rt].lazy;
            tre[rt].lazy=-1;
        }
        if (tre[rt].xr)
        {
            Txor(r1);
            Txor(r2);
            tre[r1].sum=ls-tre[r1].sum;
            tre[r2].sum=rs-tre[r2].sum;
            change(r1);
            change(r2);
            tre[rt].xr=0;
        }
    }

    void update(int rt,int l,int r,int L,int R,int v)
    {
        if (L<=l&&r<=R)
        {
            int k=r-l+1;
            if (v==2)
            {
                change(rt);
                tre[rt].sum=k-tre[rt].sum;
                tre[rt].xr^=1;
            }
            else
            {
                tre[rt].lc=tre[rt].mc=tre[rt].rc=tre[rt].sum=(v?k:0);
                tre[rt].lz=tre[rt].mz=tre[rt].rz=(v?0:k);
                tre[rt].lazy=v;
                tre[rt].xr=0;
            }
            return ;
        }
        if (l==r) return ;
        pushdown(rt,r-l+1);
        int m=(l+r)>>1;
        if (L<=m) update(rt<<1,l,m,L,R,v);
        if (R>m)  update(rt<<1|1,m+1,r,L,R,v);
        pushup(rt,r-l+1);
    }

    Node query(int rt,int l,int r,int L,int R)
    {
        Node tmp= {0};
        if (L<=l&&r<=R) return tre[rt];
        if (l==r) return tmp;
        pushdown(rt,r-l+1);
        int m=(l+r)>>1,f1=0,f2=0;
        Node r1,r2;
        if (L<=m)
        {
            r1=query(rt<<1,l,m,L,R);
            f1=1;
        }
        if (R>m)
        {
            r2=query(rt<<1|1,m+1,r,L,R);
            f2=1;
        }
        if (f1&&f2)
        {
            tmp.len=r1.len+r2.len;
            if (r1.len==r1.lc) tmp.lc=r1.lc+r2.lc;
            else tmp.lc=r1.lc;
            if (r2.rc==r2.len) tmp.rc=r1.rc+r2.rc;
            else tmp.rc=r2.rc;
            tmp.mc=Max(r1.rc+r2.lc,Max(r1.mc,r2.mc));
        }
        else if (f1) tmp=r1;
        else tmp=r2;
        return tmp;
    }

    int querysum(int rt,int l,int r,int L,int R)
    {
        if (L<=l&&r<=R) return tre[rt].sum;
        if (l==r) return 0;
        pushdown(rt,r-l+1);
        int m=(l+r)>>1,res=0;
        if (L<=m) res+=querysum(rt<<1,l,m,L,R);
        if (R>m)  res+=querysum(rt<<1|1,m+1,r,L,R);
        return res;
    }
}segtree;

int main()
{
    //  freopen("in.txt","r",stdin);
    //  freopen("out1.txt","w",stdout);
    int ncase,n,q,op,a,b;
    scanf("%d",&ncase);
    while (ncase--)
    {
        scanf("%d %d",&n,&q);
        n--;
        segtree.build(1,0,n);
        while (q--)
        {
            scanf("%d %d %d",&op,&a,&b);
            if (a>b) a^=b,b^=a,a^=b;
            if (op<3) segtree.update(1,0,n,a,b,op);
            else  if (op==3) printf("%d\n",segtree.querysum(1,0,n,a,b));
            else
            {
                Node tmp=segtree.query(1,0,n,a,b);
                printf("%d\n",tmp.mc);
            }
        }
    }
    return 0;
}