题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3397
题目大意:n个数,m次操作,5种操作类型:1,2,3,4,0
操作0:将[a,b]区间所有值全赋为0
操作1:将[a,b]区间所有值全赋为1
操作2:[a,b]区间0变成1,1变成0.
操作3:输出[a,b]区间1的个数
操作4:输出[a,b]区间最长的连续1串。
思路:线段树区间更新,合并,查询。0标记,1标记,翻转标记。维护区间1的数量,0的数量,最长连续1串,最长连续0串。左右连续0,1串。注意标记的覆盖性,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 Bsum,Wsum;
int Alazy,Olazy;
};
Node Tree[MAXN<<2];
void PushUp(int rt){
Tree[rt].Bsum=Tree[rt<<1].Bsum+Tree[rt<<1|1].Bsum;
Tree[rt].Wsum=Tree[rt<<1].Wsum+Tree[rt<<1|1].Wsum;
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].Alazy!=-1){
Tree[rt<<1].Alazy=Tree[rt<<1|1].Alazy=Tree[rt].Alazy;
Tree[rt<<1].Olazy=Tree[rt<<1|1].Olazy=0;
if(Tree[rt].Alazy==1){
Tree[rt<<1].Bls=Tree[rt<<1].Brs=Tree[rt<<1].Bms=Tree[rt<<1].Bsum=Tree[rt<<1].len;
Tree[rt<<1].Wls=Tree[rt<<1].Wrs=Tree[rt<<1].Wms=Tree[rt<<1].Wsum=0;
Tree[rt<<1|1].Bls=Tree[rt<<1|1].Brs=Tree[rt<<1|1].Bms=Tree[rt<<1|1].Bsum=Tree[rt<<1|1].len;
Tree[rt<<1|1].Wls=Tree[rt<<1|1].Wrs=Tree[rt<<1|1].Wms=Tree[rt<<1|1].Wsum=0;
}
else if(Tree[rt].Alazy==0){
Tree[rt<<1].Bls=Tree[rt<<1].Brs=Tree[rt<<1].Bms=Tree[rt<<1].Bsum=0;
Tree[rt<<1].Wls=Tree[rt<<1].Wrs=Tree[rt<<1].Wms=Tree[rt<<1].Wsum=Tree[rt<<1].len;
Tree[rt<<1|1].Bls=Tree[rt<<1|1].Brs=Tree[rt<<1|1].Bms=Tree[rt<<1|1].Bsum=0;
Tree[rt<<1|1].Wls=Tree[rt<<1|1].Wrs=Tree[rt<<1|1].Wms=Tree[rt<<1|1].Wsum=Tree[rt<<1|1].len;
}
Tree[rt].Alazy=-1;
}
if(Tree[rt].Olazy){//有反转标记
if(Tree[rt<<1].Alazy!=-1){//先
Tree[rt<<1].Alazy^=1;
if(Tree[rt<<1].Alazy==1){
Tree[rt<<1].Bls=Tree[rt<<1].Brs=Tree[rt<<1].Bms=Tree[rt<<1].Bsum=Tree[rt<<1].len;
Tree[rt<<1].Wls=Tree[rt<<1].Wrs=Tree[rt<<1].Wms=Tree[rt<<1].Wsum=0;
}
else{
Tree[rt<<1].Bls=Tree[rt<<1].Brs=Tree[rt<<1].Bms=Tree[rt<<1].Bsum=0;
Tree[rt<<1].Wls=Tree[rt<<1].Wrs=Tree[rt<<1].Wms=Tree[rt<<1].Wsum=Tree[rt<<1].len;
}
}
else{
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].Bsum,Tree[rt<<1].Wsum);
Tree[rt<<1].Olazy^=1;
}
if(Tree[rt<<1|1].Alazy!=-1){
Tree[rt<<1|1].Alazy^=1;
if(Tree[rt<<1|1].Alazy==1){
Tree[rt<<1|1].Bls=Tree[rt<<1|1].Brs=Tree[rt<<1|1].Bms=Tree[rt<<1|1].Bsum=Tree[rt<<1|1].len;
Tree[rt<<1|1].Wls=Tree[rt<<1|1].Wrs=Tree[rt<<1|1].Wms=Tree[rt<<1|1].Wsum=0;
}
else{
Tree[rt<<1|1].Bls=Tree[rt<<1|1].Brs=Tree[rt<<1|1].Bms=Tree[rt<<1|1].Bsum=0;
Tree[rt<<1|1].Wls=Tree[rt<<1|1].Wrs=Tree[rt<<1|1].Wms=Tree[rt<<1|1].Wsum=Tree[rt<<1|1].len;
}
}
else{
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);swap(Tree[rt<<1|1].Bsum,Tree[rt<<1|1].Wsum);
Tree[rt<<1|1].Olazy^=1;
}
Tree[rt].Olazy=0;
}
}
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].Bsum=Tree[rt].Wsum=0;
Tree[rt].Alazy=-1;Tree[rt].Olazy=0;
if(l==r){
if(A[l]) Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=Tree[rt].Bsum=1;
else Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=Tree[rt].Wsum=1;
return ;
}int mid=(l+r)>>1;
Build(l,mid,rt<<1,A);Build(mid+1,r,rt<<1|1,A);
PushUp(rt);
}
void AllUpdate(int ql,int qr,int val,int rt){
if(ql<=Tree[rt].l&&Tree[rt].r<=qr){
if(val==1){
Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=Tree[rt].Bsum=Tree[rt].len;
Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=Tree[rt].Wsum=0;
Tree[rt].Alazy=1;Tree[rt].Olazy=0;
return ;
}
if(val==0){
Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=Tree[rt].Bsum=0;
Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=Tree[rt].Wsum=Tree[rt].len;
Tree[rt].Alazy=0;Tree[rt].Olazy=0;
return ;
}//PushDown(rt);PushUp(rt);
if(val==2){//区间反转
if(Tree[rt].Alazy!=-1){
Tree[rt].Alazy^=1;
if(Tree[rt].Alazy==1){
Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=Tree[rt].Bsum=Tree[rt].len;
Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=Tree[rt].Wsum=0;
}
else{
Tree[rt].Bls=Tree[rt].Brs=Tree[rt].Bms=Tree[rt].Bsum=0;
Tree[rt].Wls=Tree[rt].Wrs=Tree[rt].Wms=Tree[rt].Wsum=Tree[rt].len;
}
}
else{
swap(Tree[rt].Bls,Tree[rt].Wls);swap(Tree[rt].Brs,Tree[rt].Wrs);swap(Tree[rt].Bms,Tree[rt].Wms);swap(Tree[rt].Bsum,Tree[rt].Wsum);
Tree[rt].Olazy^=1;
}return ;
}
}PushDown(rt);
if(qr<=Tree[rt<<1].r) AllUpdate(ql,qr,val,rt<<1);
else if(ql>=Tree[rt<<1|1].l) AllUpdate(ql,qr,val,rt<<1|1);
else{
AllUpdate(ql,Tree[rt<<1].r,val,rt<<1);
AllUpdate(Tree[rt<<1|1].l,qr,val,rt<<1|1);
}PushUp(rt);
}
int QuerySum(int ql,int qr,int rt){
if(ql<=Tree[rt].l&&Tree[rt].r<=qr) return Tree[rt].Bsum;
//if(Tree[rt].l==Tree[rt].r) return Tree[rt].Bsum;
PushDown(rt);
int ans=0;
if(qr<=Tree[rt<<1].r) ans=QuerySum(ql,qr,rt<<1);
else if(ql>=Tree[rt<<1|1].l) ans=QuerySum(ql,qr,rt<<1|1);
else ans=QuerySum(ql,qr,rt<<1)+QuerySum(ql,qr,rt<<1|1);
PushUp(rt);
return ans;
}
int QueryLen(int ql,int qr,int rt){
if(ql<=Tree[rt].l&&Tree[rt].r<=qr) return Tree[rt].Bms;
//if(Tree[rt].l==Tree[rt].r) return Tree[rt].Bms;
PushDown(rt);
int ans=0;
if(qr<=Tree[rt<<1].r) ans=QueryLen(ql,qr,rt<<1);
else if(ql>=Tree[rt<<1|1].l) ans=QueryLen(ql,qr,rt<<1|1);
else{
ans=max(QueryLen(ql,qr,rt<<1),QueryLen(ql,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 Bms=%d Brs=%d Bsum=%d Wls=%d Wms=%d Wrs=%d Wsum=%d\n",Tree[rt].l,Tree[rt].r,Tree[rt].Bls,Tree[rt].Bms,Tree[rt].Brs,Tree[rt].Bsum,Tree[rt].Wls,Tree[rt].Wms,Tree[rt].Wrs,Tree[rt].Wsum);
//if(Tree[rt].lazy!=-1) return ;
if(Tree[rt].l==Tree[rt].r) return ;
PushDown(rt);
Show(rt<<1);Show(rt<<1|1);
PushUp(rt);
//printf("l=%d r=%d Bls=%d Bms=%d Brs=%d Bsum=%d Wls=%d Wms=%d Wrs=%d Wsum=%d\n",Tree[rt].l,Tree[rt].r,Tree[rt].Bls,Tree[rt].Bms,Tree[rt].Brs,Tree[rt].Bsum,Tree[rt].Wls,Tree[rt].Wms,Tree[rt].Wrs,Tree[rt].Wsum);
}
};
SegTree Seg;
int A[MAXN];
int n,m;
int main(){
int T;scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) scanf("%d",&A[i]);
Seg.Build(1,n,1,A);//Seg.Show(1);
while(m--){
int opt,a,b;scanf("%d%d%d",&opt,&a,&b);
++a;++b;
if(opt==0){//全幅为0
Seg.AllUpdate(a,b,0,1);
}
else if(opt==1){//全幅为1
Seg.AllUpdate(a,b,1,1);
}
else if(opt==2){//反转
Seg.AllUpdate(a,b,2,1);
}
else if(opt==3){//输出1的个数
printf("%d\n",Seg.QuerySum(a,b,1));
}
else{//输出区间最长连续1串
printf("%d\n",Seg.QueryLen(a,b,1));
}//Seg.Show(1);//puts("");Seg.Show(1);
}
}
}
/*
1
13 10
1 0 1 0 1 0 0 1 1 0 0 1 1
0 0 6
2 1 7
3 2 6
4 6 8
0 6 7
2 9 12
2 2 3
2 8 9
3 1 5
1 3 9
*/