线段树基础之区间合并HDU3308

线段树基础之区间合并HDU3308

题意

给出两种操作
1.单点修改
2.求区间最大严格递增长度

做法

线段树维护区间递增长度
tree的构造很重要
我一开始用了一个maxx记录递增长度，lval记录左端点值，rval记录右端点值
但是发现这样好像并不能做到push_up，因为情况分不清楚
后来看了题解后
真的很巧妙，但是自己第一次接触实在是想不出来0.0

AC代码

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define db1(x) printf("%d cx\n",x)
#define db2(x,y) printf("%d %d cx\n",x,y)
#define db3(x,y,z) printf("%d %d %d cx\n",x,y,z)
#define db4(x,y,z,q) printf("%d %d %d %d cx\n",x,y,z,q)
#define DB1(x) printf("%lld cx\n",x)
#define DB2(x,y) printf("%lld %lld cx\n",x,y)
#define DB3(x,y,z) printf("%lld %lld %lld cx\n",x,y,z)
#define DB4(x,y,z,q) printf("%lld %lld %lld %lld cx\n",x,y,z,q)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=0x3f3f3f3f;
const ll INFF=1e18;
struct node{
    int lval;
    int rval;//左右端点的值
    int llen;//以左端点为开始的最长串长度
    int rlen;//以右端点为结束的最长串长度
    int maxx;//整个区间的最长串长度
}tree[maxn<<2];
void pu(int rt,int l,int r)
{
    int mid=(l+r)>>1;//[l,mid][mid+1,r]
    tree[rt].llen=tree[rt<<1].llen;
    tree[rt].rlen=tree[rt<<1|1].rlen;
    tree[rt].lval=tree[rt<<1].lval;
    tree[rt].rval=tree[rt<<1|1].rval;
    tree[rt].maxx=max(tree[rt<<1].maxx,tree[rt<<1|1].maxx);
    if (tree[rt<<1].rval<tree[rt<<1|1].lval)
    {
        if (tree[rt<<1].llen==mid-l+1)
            tree[rt].llen+=tree[rt<<1|1].llen;
        if (tree[rt<<1|1].rlen==r-mid)
            tree[rt].rlen+=tree[rt<<1].rlen;
        tree[rt].maxx=max(tree[rt].maxx,tree[rt<<1].rlen+tree[rt<<1|1].llen);
    }
    tree[rt].maxx=max(tree[rt].maxx,max(tree[rt].llen,tree[rt].rlen));
}
void build(int rt,int l,int r)
{
    if (l==r)
    {
        scanf("%d",&tree[rt].lval);
        tree[rt].rval=tree[rt].lval;
        tree[rt].llen=tree[rt].rlen=tree[rt].maxx=1;
        return;
    }
    int mid=(l+r)>>1;
    build(lson);
    build(rson);
    pu(rt,l,r);
}
void update(int p,int x,int rt,int l,int r)
{
    if (l==r)
    {
        tree[rt].lval=tree[rt].rval=x;
        return;
    }
    int mid=(l+r)>>1;
    if (p<=mid)update(p,x,lson);
    else update(p,x,rson);
    pu(rt,l,r);
}
int query(int L,int R,int rt,int l,int r)
{
    if (L<=l&&r<=R)return tree[rt].maxx;
    int mid=(l+r)>>1;
    //这边应该是只能这么分类的吧
    //分成两类是不行的
    if (L>mid)return query(L,R,rson);//只可能在右子树取到
    else if (R<=mid)return query(L,R,lson);//只可能在左子树取到
    else
    {
        int x1=query(L,R,lson);
        int x2=query(L,R,rson);
        int ans=0;
        ans=max(ans,max(x1,x2));
        if (tree[rt<<1].rval<tree[rt<<1|1].lval)//左右各取一段
        {
            ans=max(ans,min(mid-L+1,tree[rt<<1].rlen)+min(R-mid,tree[rt<<1|1].llen));
        }
        return ans;
    }
}
int main()
{
    int t,n,m,x,y;
    char s[5];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        build(1,1,n);
        while(m--)
        {
            scanf("%s",s);
            if (s[0]=='U')
            {
                scanf("%d%d",&x,&y);
                update(x+1,y,1,1,n);
            }
            else
            {
                scanf("%d%d",&x,&y);
                W(query(x+1,y+1,1,1,n));
            }
        }
    }
    return 0;
}