这个被 notonlysuccess 归类为区间合并
想来区间合并的题 PushUp 不但更新的时候会用到,左右两个孩子得到的结果也要用 PushUp 处理,就换了一下PushUp的形式。爽
写着写着。。不知不觉这宏就变的越来越多了。
#include <stdio.h>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <string.h>
using namespace std;
#define READ freopen("acm.in","r",stdin)
#define ll long long
#define PII pair<int,int>
#define PDI pair<double,int>
#define MPI map<int,int>::iterator
#define fst first
#define sec second
#define MS(x,d) memset(x,d,sizeof(x))
#define INF 0x3f3f3f3f
#define ALL(x) x.begin(),x.end()
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MAX 2100000
#define ROOT 0,n-1,1
struct node
{
int head,tail;
int inMax;
int headMax,tailMax;
int len;
void print()
{
printf("head %d tail %d in %d hm %d tm %d\n",head,tail,inMax,headMax,tailMax);
}
}data[MAX<<2],dumy;
int num[MAX<<1];
void PushUp(node &rt,node &ls,node &rs)
{
rt.len=ls.len+rs.len;
rt.head=ls.head;
rt.tail=rs.tail;
rt.inMax=max(ls.inMax,rs.inMax);
if(ls.tail<rs.head)
rt.inMax=max(rt.inMax,ls.tailMax+rs.headMax);
if(ls.headMax==ls.len&&ls.tail<rs.head)
rt.headMax=ls.headMax+rs.headMax;
else
rt.headMax=ls.headMax;
if(rs.tailMax==rs.len&&ls.tail<rs.head)
rt.tailMax=ls.tailMax+rs.tailMax;
else
rt.tailMax=rs.tailMax;
}
void update(int L,int R,int x,int l,int r,int rt)
{
if(L>r||R<l)
return ;
if(L<=l&&r<=R)
{
data[rt].head=x;
data[rt].tail=x;
return ;
}
int m=(l+r)>>1;
update(L,R,x,lson);
update(L,R,x,rson);
PushUp(data[rt],data[rt<<1],data[rt<<1|1]);
}
node query(int L,int R,int l,int r,int rt)
{
if(L>r||R<l)
return dumy;
if(L<=l&&r<=R)
return data[rt];
int m=(l+r)>>1;
node n1,n2;
if(L<=m)
n1=query(L,R,lson);
if(R>m)
n2=query(L,R,rson);
if(R<=m)
return n1;
if(L>m)
return n2;
node ret;
PushUp(ret,n1,n2);
return ret;
}
void build(int l,int r,int rt)
{
if(l==r)
{
data[rt]=(node){num[l],num[l],1,1,1,1};
return ;
}
int m=(l+r)>>1;
build(lson);
build(rson);
PushUp(data[rt],data[rt<<1],data[rt<<1|1]);
}
int cas,n,q;
int main()
{
READ;
scanf("%d",&cas);
for(int T=1;T<=cas;T++)
{
scanf("%d%d",&n,&q);
for(int i=0;i<n;i++)
scanf("%d",&num[i]);
build(0,n-1,1);
while(q--)
{
char op[100];
scanf("%s",op);
if(op[0]=='U')
{
int l,r,add;
scanf("%d%d",&l,&add);
update(l,l,add,ROOT);
}
else
{
int l,r;
scanf("%d%d",&l,&r);
node ans=query(l,r,ROOT);
cout<<ans.inMax<<endl;
}
}
}
return 0;
}