HDU 3911 Black And White

区间合并。简化版的HDU 3397 Sequence operation。区间异或，求最长连续区间的长度。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<map>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", s)
#define PC(n) printf("Case %d: ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1e9+7;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const int N = 111111;
const int M = N << 2;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

int lsum[2][M], rsum[2][M], msum[2][M], col[M], L, R;

void get(int rt, int k, int a, int b)
{
    lsum[0][rt] = rsum[0][rt] = msum[0][rt] = k ? a : b;
    lsum[1][rt] = rsum[1][rt] = msum[1][rt] = k ? b : a;
}

void pushup(int m, int rt)
{
    REP(i, 2)
    {
        lsum[i][rt] = lsum[i][rt << 1];
        rsum[i][rt] = rsum[i][rt << 1 | 1];
        if(lsum[i][rt] == (m - (m >> 1)))lsum[i][rt] += lsum[i][rt << 1 | 1];
        if(rsum[i][rt] == (m >> 1))rsum[i][rt] += rsum[i][rt << 1];
        msum[i][rt] = max(lsum[i][rt << 1 | 1] + rsum[i][rt << 1], max(msum[i][rt << 1], msum[i][rt << 1 | 1]));
    }
}

void build(int l, int r, int rt)
{
    col[rt] = 0;
    if(l == r)
    {
        int k;
        RI(k);
        get(rt, k, 0, 1);
        return;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    pushup(r - l + 1, rt);
}

void __swap(int rt)
{
    swap(lsum[0][rt], lsum[1][rt]);
    swap(rsum[0][rt], rsum[1][rt]);
    swap(msum[0][rt], msum[1][rt]);
}

void pushdown(int rt)
{
    if(col[rt])
    {
        col[rt] = 0;
        __swap(rt << 1);
        __swap(rt << 1 | 1);
        col[rt << 1] ^= 1;
        col[rt << 1 | 1] ^= 1;
    }
}

void update(int l, int r, int rt)
{
    if(L <= l && r <= R)
    {
        col[rt] ^= 1;
        __swap(rt);
        return ;
    }
    pushdown(rt);
    int m = (l + r) >> 1;
    if(L <= m)update(lson);
    if(R > m)update(rson);
    pushup(r - l + 1, rt);
}

int query(int l, int r, int rt)
{
    if(L <= l && r <= R)return msum[1][rt];
    pushdown(rt);
    int m = (l + r) >> 1, ans = 0;
    if(L <= m)ans = max(ans, query(lson));
    if(R > m) ans = max(ans, query(rson));
    if(L <= m && m < R)
    {
        int t1 = min(rsum[1][rt << 1], m - L + 1);
        int t2 = min(lsum[1][rt << 1 | 1], R - m);
        ans = max(ans, t1 + t2);
    }
    pushup(r - l + 1, rt);
    return ans;
}

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int n, m, op;
    while(RI(n) != EOF)
    {
        build(1, n, 1);
        RI(m);
        while(m--)
        {
            RIII(op, L, R);
            if(op)update(1, n, 1);
            else PI(query(1, n, 1));
        }
    }
    return 0;
}