杭电 1754

线段树算法，这个星期有任务，做线段树题目

昨天看了一天的资料才弄好一个题目

今天写出来

#include "stdio.h"
int t1,t2;
struct node 
{
	int l,r,max;
}no[3*200000];
int ks[200006];

int max(int a, int b)
{
	return a>b?a:b;
}
void buid(int a, int b, int c)
{
	no[c].l = a;
	no[c].r = b ;
	if (a == b )
	{
		no[c].max = ks[a] ;
		return ;
	}
	int mid = (a+b)>>1;
	buid(a , mid , 2*c);
	buid( mid+1 , b , 2*c+1);
	int x,y;
	x = no[2*c].max;
	y = no[2*c+1].max ;
	no[c].max = max(  x,y);
}

void uodate_tree(int a , int b, int c)
{
	if(a == b)
	{
		no[c].max = t2 ;
		return ;
	}
	
	int mid = ( a + b ) >>1 ;
	if (t1 <= mid)
	{
		uodate_tree(a , mid , 2*c);
	}
	else
		uodate_tree(mid+1 , b , 2*c+1);
	int x = no[2*c].max;
	int y = no[2*c+1].max ; 
	no[c].max = max(x , y );
}

int find_tree(int a, int b, int c)
{
	if ( (no[c].l == a ) && (no[c].r == b ))
	{
		return no[c].max;
	}
	int mid = (no[c].l+no[c].r ) >> 1;
	if (b <= mid )
	{
		find_tree(a , b , 2*c);
	}
	else
	if (a > mid )
	{
		find_tree(a , b , 2*c+1);
	}
	else
	{
		int x= find_tree(a , mid , 2*c);
		int y = find_tree(mid+1 , b , 2*c +1);
		return max(x, y );
	}
}

int main()
{
	int n , m ;
	char c;
	while (scanf("%d%d",&n,&m) != EOF)
	{
		for (int i = 1 ; i <= n ; ++i )
		{
			scanf("%d",&ks[i]);
		}
		buid(1, n , 1 );
		for (i = 0 ; i < m ; ++i )
		{
			getchar();
			scanf("%c%d%d",&c,&t1,&t2);
			if (c == 'Q')
			{
				printf("%d\n",find_tree(t1,t2, 1));
			}
			else
				if (c == 'U')
				{
					uodate_tree(1 , n , 1 );
				}
		}
	}
	return 0 ;
}