HDU 3308 LCIS (线段树)

LCIS

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2604    Accepted Submission(s): 1131

Problem Description
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.
 

Sample Input
1
10 10
7 7 3 3 5 9 9 8 1 8
Q 6 6
U 3 4
Q 0 1
Q 0 5
Q 4 7
Q 3 5
Q 0 2
Q 4 6
U 6 10
Q 0 9
 

Sample Output
1
1
4
2
3
1
2
5

 

线段树区间合并。每一个节点维护：1）当前区间最大连续上升序列。2）当前区间从左起往右的最大上身序列。3）当前区间从右往左的最大下降序列。4）当前区间最左端的值。5）当前区间最右端的值。然后就是向上更新和查找的处理问题了。只要每次判断是否左孩子的最右端值是否小于右孩子的最左端值，如果小于，则说明这两个区间是可以合并的。

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define SIZE 100005
#define ls l,mid,rt<<1
#define rs mid+1,r,rt<<1|1

using namespace std;

int sum[SIZE<<2],lsum[SIZE<<2],rsum[SIZE<<2],lmax[SIZE<<2],rmax[SIZE<<2];

void pushUp(int rt,int itv)
{
	lsum[rt] = lsum[rt<<1];
	rsum[rt] = rsum[rt<<1|1];
	lmax[rt] = lmax[rt<<1];
	rmax[rt] = rmax[rt<<1|1];
	if(lsum[rt<<1] == (itv - (itv>>1)))
	{
		if(rmax[rt<<1] < lmax[rt<<1|1])
			lsum[rt] += lsum[rt<<1|1];
	}
	if(rsum[rt<<1|1] == (itv >> 1))
	{
		if(rmax[rt<<1] < lmax[rt<<1|1])
			rsum[rt] += rsum[rt<<1];
	}
	sum[rt] = max(sum[rt<<1],sum[rt<<1|1]);
	if(rmax[rt<<1] < lmax[rt<<1|1])
		sum[rt] = max(sum[rt],lsum[rt<<1|1]+rsum[rt<<1]);
}

void build(int l,int r,int rt)
{
	if(l == r)
	{
		sum[rt] = lsum[rt] = rsum[rt] = 1;
		scanf("%d",&lmax[rt]);
		rmax[rt] = lmax[rt];
		return ;
	}
	int mid = (l + r) >> 1;
	build(ls);
	build(rs);
	pushUp(rt,r-l+1);
}

void update(int l,int r,int rt,int p,int w)
{
	if(l == r && l == p)
	{
		lmax[rt] = rmax[rt] = w;
		sum[rt] = lsum[rt] = rsum[rt] = 1;
		return;
	}
	int mid = (l + r) >> 1;
	if(p <= mid) update(ls,p,w);
	else update(rs,p,w);
	pushUp(rt,r-l+1);
}

int query(int l,int r,int rt,int L,int R)
{
	if(L <= l && r <= R)
		return sum[rt];
	int mid = (l + r) >> 1;
	if(L > mid)
		return query(rs,L,R);
	else if(R <= mid) 
		return query(ls,L,R);
	else
	{
		int ll = query(ls,L,R);
		int rr = query(rs,L,R);
		if(rmax[rt<<1] < lmax[rt<<1|1])
		{
			int Lt = min(rsum[rt<<1],mid-L+1);
			int Rt = min(lsum[rt<<1|1],R-mid);
			return max(max(ll,rr),Lt+Rt);
		}
		return max(ll,rr);
	}
}

int T;
int N,M;
char oper[5];
int s,e;

int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&N,&M);
		build(1,N,1);
		while(M--)
		{
			scanf("%s",oper);
			scanf("%d%d",&s,&e);
			++s;
			if(oper[0] == 'Q')
			{
				++e;
				printf("%d\n",query(1,N,1,s,e));
			}
			else
				update(1,N,1,s,e);
		}
	}
	return 0;
}