LCIS HDU - 3308

题目描述

LCIS HDU - 3308
Given n integers.
You have two operations:
U A B: replace the Ath number by B. (index counting from 0)
Q A B: output the length of the longest consecutive increasing subsequence (LCIS) in [a, b].
Input
T in the first line, indicating the case number.
Each case starts with two integers n , m(0<n,m<=105).
The next line has n integers(0<=val<=105).
The next m lines each has an operation:
U A B(0<=A,n , 0<=B=105)
OR
Q A B(0<=A<=B< n).
Output
For each Q, output the answer.

链接

链接: https://acm.hdu.edu.cn/showproblem.php?pid=3308.

想法

区间合并的裸题。
使用线段树求解关于区间合并的问题。首先，线段树结构体需要记录l , r , val。
其次由于需要合并区间，需要记录①从左边开始所能组成的最大LCIS长度 ； ②从右边开始的反过来的LCIS（就是递减的最小的，比如[…4123]为3）； 以及③最大的长度
为了通过pushup得到非叶节点的①②③，还需要记录该区间最左边的值和最右边的值。

---

之后就是代码实现了

AC代码

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;
const int N = 1e5 + 1e3;
int n , m , num[N];
struct Node{
	int l , r , val;
	int maxlen , Lmaxlen , Rmaxlen , rval , lval;
}tree[N<<2];

void pushup(int k){
	tree[k].maxlen = max(tree[k<<1].maxlen , tree[k<<1|1].maxlen);
	tree[k].lval = tree[k<<1].lval;
	tree[k].rval = tree[k<<1|1].rval;
	int mid = (tree[k].l + tree[k].r)>>1;
	tree[k].Lmaxlen = tree[k<<1].Lmaxlen;
	tree[k].Rmaxlen = tree[k<<1|1].Rmaxlen;
	int l = tree[k].l ;
	int r = tree[k].r ;
	if(tree[k<<1].rval<tree[k<<1|1].lval){
		tree[k].maxlen = max(tree[k].maxlen,tree[k<<1].Rmaxlen+tree[k<<1|1].Lmaxlen);
		if(tree[k<<1].Lmaxlen == (mid-l+1)){
			tree[k].Lmaxlen += tree[k<<1|1].Lmaxlen;
		}
		if(tree[k<<1|1].Rmaxlen == (r-mid)){
			tree[k].Rmaxlen += tree[k<<1].Rmaxlen;
		}
	}
	
}
void build(int k , int l , int r){
	tree[k] = {l,r};
	if(l == r){
		tree[k].lval = tree[k].rval = tree[k].val = num[l];
		tree[k].Lmaxlen = tree[k].Rmaxlen = tree[k].maxlen = 1;
		return ;
	}
	int mid = (l+r)>>1;
	build(k<<1 , l , mid);
	build(k<<1|1 , mid+1 , r);
	pushup(k);
}
void change(int k , int pos , int tonum){
	if(tree[k].l == tree[k].r && tree[k].l == pos){
		tree[k].val = tree[k].lval = tree[k].rval = tonum;
		return ;
	}
	int mid = (tree[k].l + tree[k].r)>>1;
	if(pos <= mid){
		change(k<<1 , pos , tonum);
	}else{
		change(k<<1|1 , pos , tonum);
	}
	pushup(k);
}
Node getRes(int k , int l , int r){
	if(tree[k].l >= l && tree[k].r <= r) return tree[k];
	int mid = (tree[k].r + tree[k].l)>>1;
	if(r <= mid) return getRes(k<<1 , l , r);
	else if(l > mid) return getRes(k<<1|1 , l , r);
	else{
		Node tmp1 = getRes(k<<1 , l , r );
		Node tmp2 = getRes(k<<1|1 , l , r);
		Node res = {tmp1.l , tmp2.r};
		res.maxlen = max(tmp1.maxlen , tmp2.maxlen);
		res.lval = tmp1.lval;
		res.rval = tmp2.rval;
		int mid = (tree[k].l + tree[k].r)>>1;
		res.Lmaxlen = tmp1.Lmaxlen;
		res.Rmaxlen = tmp2.Rmaxlen;

		if(tmp1.rval<tmp2.lval){
			res.maxlen = max(res.maxlen,tmp1.Rmaxlen+tmp2.Lmaxlen);
			if(tmp1.Lmaxlen == (tmp1.r-tmp1.l+1)){
				res.Lmaxlen += tmp2.Lmaxlen;
			}
			if(tmp2.Rmaxlen == (tmp2.r-tmp2.l+1)){
				res.Rmaxlen += tmp1.Rmaxlen;
			}
		}
		return res;
	}
}
int main(){
	ios::sync_with_stdio(false);
	int i , j , t , k , a , b;
	char ope;
	cin>>t;
	while(t--){
		cin>>n>>m;
		for(i = 1 ; i <= n ; i ++ ) cin>>num[i];
		build(1,1,n); 
		for(i = 1 ; i <= m ; i ++ ){
			cin>>ope>>a>>b;
			if(ope == 'U'){
				change(1,a+1,b);
			}else{
				cout<<getRes(1,a+1,b+1).maxlen<<endl;
			}
		}
	}
	return 0;
}

但是我比较疑惑的一点是，为什么看到很多大佬的代码里面的查询函数的else选项里，没有给res的L R赋值，我试了一下，不赋值也过了。。