HDU-3911-Black And White（线段树，区间翻转，合并）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3911

题目大意：给出n个棋子，0或1，表示黑或白。每次操作可以翻转区间的颜色||查询区间的颜色

思路：线段树区间翻转和合并

ACCode：

#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<time.h>
#include<math.h>
// srand(unsigned)time(NULL));rand();
  
#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<string>
#include<fstream>
#include<iostream>
#include<algorithm>
  
#define ll long long
#define Pii pair<int,int>
#define clean(a,b) memset(a,b,sizeof(a))
using namespace std;
  
const int MAXN=1e5+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const ll MOD=1e9+7;
const double PI=acos(-1.0);
const double EPS=1.0e-8;
//unsigned register
// ios::sync_with_stdio(false)

struct SegTree{
	struct Node{
		int l,r;
		int Bls,Brs,Bms,Wls,Wrs,Wms,len;
		int lazy;
	};
	Node Tree[MAXN<<2];
	
	void PushUp(int rt){
		Tree[rt].Bms=max(max(Tree[rt<<1].Bms,Tree[rt<<1|1].Bms),Tree[rt<<1].Brs+Tree[rt<<1|1].Bls);
		Tree[rt].Wms=max(max(Tree[rt<<1].Wms,Tree[rt<<1|1].Wms),Tree[rt<<1].Wrs+Tree[rt<<1|1].Wls);
		Tree[rt].Bls=Tree[rt<<1].Bls;Tree[rt].Brs=Tree[rt<<1|1].Brs;
		Tree[rt].Wls=Tree[rt<<1].Wls;Tree[rt].Wrs=Tree[rt<<1|1].Wrs;
		if(Tree[rt<<1].Bls==Tree[rt<<1].len) Tree[rt].Bls+=Tree[rt<<1|1].Bls;
		if(Tree[rt<<1|1].Brs==Tree[rt<<1|1].len) Tree[rt].Brs+=Tree[rt<<1].Brs;
		if(Tree[rt<<1].Wls==Tree[rt<<1].len) Tree[rt].Wls+=Tree[rt<<1|1].Wls;
		if(Tree[rt<<1|1].Wrs==Tree[rt<<1|1].len) Tree[rt].Wrs+=Tree[rt<<1].Wrs;
	}
	void PushDown(int rt){
		if(Tree[rt].lazy){
			Tree[rt<<1].lazy^=1;Tree[rt<<1|1].lazy^=1;//Tree[rt].lazy;
			//颜色交换 
			swap(Tree[rt<<1].Bls,Tree[rt<<1].Wls);swap(Tree[rt<<1].Brs,Tree[rt<<1].Wrs);swap(Tree[rt<<1].Bms,Tree[rt<<1].Wms);
			swap(Tree[rt<<1|1].Bls,Tree[rt<<1|1].Wls);swap(Tree[rt<<1|1].Brs,Tree[rt<<1|1].Wrs);swap(Tree[rt<<1|1].Bms,Tree[rt<<1|1].Wms);
			Tree[rt].lazy^=1;
		}
	}
	void Build(int l,int r,int rt,int A[]){
		Tree[rt].l=l;Tree[rt].r=r;Tree[rt].len=r-l+1;
		Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=0;
		Tree[rt].lazy=0;
		if(l==r){
			if(A[l]) Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=1;
			else Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=1;
			return ;
		}
		int mid=(l+r)>>1;
		Build(l,mid,rt<<1,A);Build(mid+1,r,rt<<1|1,A);
		PushUp(rt);
	}
	void Update(int ql,int qr,int rt){
		if(Tree[rt].l>=ql&&Tree[rt].r<=qr){
			swap(Tree[rt].Bls,Tree[rt].Wls);
			swap(Tree[rt].Brs,Tree[rt].Wrs);
			swap(Tree[rt].Bms,Tree[rt].Wms);
			Tree[rt].lazy^=1;
			return ;
		}PushDown(rt);
		if(qr<=Tree[rt<<1].r) Update(ql,qr,rt<<1);
		else if(ql>=Tree[rt<<1|1].l) Update(ql,qr,rt<<1|1);
		else{
			Update(ql,Tree[rt<<1].r,rt<<1);
			Update(Tree[rt<<1|1].l,qr,rt<<1|1);
		}PushUp(rt);
	}
	int Query(int ql,int qr,int rt){
		if(Tree[rt].l>=ql&&Tree[rt].r<=qr) return Tree[rt].Bms;
		PushDown(rt);
		int ans=0;
		if(qr<=Tree[rt<<1].r) ans=Query(ql,qr,rt<<1);
		else if(ql>=Tree[rt<<1|1].l) ans=Query(ql,qr,rt<<1|1);
		else{
			ans=max(Query(ql,Tree[rt<<1].r,rt<<1),Query(Tree[rt<<1|1].l,qr,rt<<1|1));
			ans=max(ans,min(Tree[rt<<1].r-ql+1,Tree[rt<<1].Brs)+min(qr-Tree[rt<<1|1].l+1,Tree[rt<<1|1].Bls));
		}PushUp(rt);
		return ans;
	}
	void Show(int rt){
		printf("l=%d r=%d Bls=%d Brs=%d Bms=%d Wls=%d Wrs=%d Wms=%d\n",Tree[rt].l,Tree[rt].r,Tree[rt].Bls,Tree[rt].Brs,Tree[rt].Bms,Tree[rt].Wls,Tree[rt].Wrs,Tree[rt].Wms); 
		if(Tree[rt].l==Tree[rt].r) return ;
		PushDown(rt);
		Show(rt<<1);Show(rt<<1|1);
		PushUp(rt);
	}
};
SegTree Seg;
int A[MAXN];
int n,m;

int main(){
	while(~scanf("%d",&n)){
		for(int i=1;i<=n;++i) scanf("%d",&A[i]);
		Seg.Build(1,n,1,A);
		scanf("%d",&m);
		while(m--){
			int opt,l,r;scanf("%d%d%d",&opt,&l,&r);
			if(opt==0){//查询 
				printf("%d\n",Seg.Query(l,r,1));
			}
			else{//反转 
				Seg.Update(l,r,1);
				//Seg.Show(1);
			}
		}
	}
}

/*
12
1 0 0 1 0 1 1 0 1 1 1 1
100
0 4 9
0 4 8
1 2 4
0 4 12


*/