线段树 区间合并 F - Sequence operation

F - Sequence operation

 
题解：
这个题目不是一个特别难的题目，但是呢，写了好久，首先线段树难敲，其次就是bug难找，最后这个代码都被我改的乱七八糟的了，
这个有两个地方要注意一下，一个是取反的lazy标志，每次取反都是对1取异或，还有一个也是这个取反的lazy标志，
这个标志再第一种操作之后要进行消除。
 

#include <cstdio>
#include <cstdlib>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <string>
#include <iostream>
#include <stack>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e6 + ;
struct node
{
    int sum;
    int max_sub, max_zero;
    int l, r, len;
    int lazy1, lazy2;
    int max_prezero, max_lastzero;
    int max_preone, max_lastone;
}tree[maxn * ];
int a[maxn];
 
void push_up(int id)
{
    tree[id].sum = tree[id << ].sum + tree[id <<  | ].sum;
 
    tree[id].max_preone = tree[id << ].max_preone;
    if (tree[id].max_preone == tree[id << ].len)  tree[id].max_preone += tree[id <<  | ].max_preone;
    tree[id].max_lastone = tree[id <<  | ].max_lastone;
    if (tree[id].max_lastone == tree[id <<  | ].len)    tree[id].max_lastone += tree[id << ].max_lastone;
    tree[id].max_sub = max(tree[id << ].max_lastone + tree[id <<  | ].max_preone, max(tree[id << ].max_sub, tree[id <<  | ].max_sub));
 
    tree[id].max_prezero = tree[id << ].max_prezero;
    if (tree[id].max_prezero == tree[id << ].len)    tree[id].max_prezero += tree[id <<  | ].max_prezero;
    tree[id].max_lastzero = tree[id <<  | ].max_lastzero;
    if (tree[id].max_lastzero == tree[id <<  | ].len)    tree[id].max_lastzero += tree[id << ].max_lastzero;
    tree[id].max_zero = max(tree[id << ].max_lastzero + tree[id <<  | ].max_prezero, max(tree[id << ].max_zero, tree[id <<  | ].max_zero));
 
    return;
}
 
void chang1(int id, int val)
{
    if (val)
    {
        tree[id].sum = tree[id].len;
        tree[id].max_preone = tree[id].max_lastone = tree[id].max_sub = tree[id].len;
        tree[id].max_zero = tree[id].max_prezero = tree[id].max_lastzero = ;
    }
    else
    {
        tree[id].sum = ;
        tree[id].max_preone = tree[id].max_lastone = tree[id].max_sub = ;
        tree[id].max_zero = tree[id].max_prezero = tree[id].max_lastzero = tree[id].len;
    }
}
 
void chang2(int id)
{
    swap(tree[id].max_sub, tree[id].max_zero);
    swap(tree[id].max_prezero, tree[id].max_preone);
    swap(tree[id].max_lastone, tree[id].max_lastzero);
    tree[id].sum = tree[id].len - tree[id].sum;
}
 
void push_down(int id)
{
    if (tree[id].lazy1)
    {
        chang1(id << , tree[id].lazy1 - );
        chang1(id <<  | , tree[id].lazy1 - );
        tree[id << ].lazy1 = tree[id <<  | ].lazy1 = tree[id].lazy1;
        tree[id << ].lazy2 =tree[id <<  | ].lazy2 = ;
        tree[id].lazy1 = ;
    }
    if (tree[id].lazy2)
    {
        chang2(id << );
        chang2(id <<  | );
 
        tree[id << ].lazy2 ^= ;
        tree[id <<  | ].lazy2 ^= ;
        tree[id].lazy2 = ;
    }
}
 
void build(int id, int l, int r)
{
    tree[id].l = l;
    tree[id].r = r;
    tree[id].lazy1 = ;
    tree[id].lazy2 = ;
    tree[id].len = r - l + ;
    if (l == r)
    {
        if (a[l]) chang1(id, );
        else chang1(id, );
        return;
    }
    int mid = (l + r) >> ;
    build(id << , l, mid);
    build(id <<  | , mid + , r);
    push_up(id);
}
 
void update_change(int id, int l, int r, int z)
{
    if (l <= tree[id].l&&r >= tree[id].r)
    {
        chang1(id, z);
        tree[id].lazy1 = z + ;
        tree[id].lazy2 = ;
        return;
    }
    push_down(id);
    int mid = (tree[id].l + tree[id].r) >> ;
    if (l <= mid) update_change(id << , l, r, z);
    if (r > mid) update_change(id <<  | , l, r, z);
    push_up(id);
}
 
void update_trans(int id, int l, int r)
{
    if (l <= tree[id].l&&r >= tree[id].r)
    {
        tree[id].lazy2 ^= ;
        chang2(id);
        return;
    }
    push_down(id);
    int mid = (tree[id].l + tree[id].r) >> ;
    if (l <= mid) update_trans(id << , l, r);
    if (r > mid) update_trans(id <<  | , l, r);
    push_up(id);
}
 
int query_sum(int id, int l, int r)
{
    if (l <= tree[id].l&&r >= tree[id].r)
    {
        return tree[id].sum;
    }
    push_down(id);
    int mid = (tree[id].l + tree[id].r) >> , ans = ;
    if (l <= mid) ans += query_sum(id << , l, r);
    if (r > mid) ans += query_sum(id <<  | , l, r);
    return ans;
}
 
int query(int id, int l, int r)
{
    int ans = ;
    if (l <= tree[id].l&&r >= tree[id].r)
    {
        return tree[id].max_sub;
    }
    push_down(id);
    int mid = (tree[id].l + tree[id].r) >> ;
    if (l <= mid) ans = max(ans, query(id << , l, r));
    if (r > mid) ans = max(ans, query(id <<  | , l, r));
    ans = max(ans, min(mid - l + , tree[id << ].max_lastone) + min(r - mid, tree[id <<  | ].max_preone));
    return ans;
}
 
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        for (int i = ; i <= n; i++) scanf("%d", &a[i]);
        build(, , n);
        while (m--)
        {
            int c, x, y;
            scanf("%d%d%d", &c, &x, &y);
            if (c == ) update_change(, x + , y + , );
            if (c == ) update_change(, x + , y + , );
            if (c == ) update_trans(, x + , y + );
            if (c == )
            {
                int ans = query_sum(, x + , y + );
                printf("%d\n", ans);
            }
            if (c == )
            {
                int ans = query(, x + , y + );
                printf("%d\n", ans);
            }
        }
    }
    return ;
}