HDU1754 - I Hate It

线段树修改点求区间最大值，还是水题，因为输入问题TLE了一次。继续熟悉敲法。

/****************************************************/
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <stack>
#include <map>
#include <queue>
#include <algorithm>
#include <ctime>
#define EPS 1E-8
#define MAXN 200010
#define INF (~0U >> 2)
#define MOD 10007
#define Lson l, mid, rt << 1
#define Rson mid + 1, r, rt << 1 | 1
using namespace std;
typedef long long LL;
/****************************************************/
int Max[MAXN << 2];
void push_up(int rt)
{
	Max[rt] = max(Max[rt << 1], Max[rt << 1 | 1]);
}

void build(int l, int r, int rt)
{
	if (l == r)
	{
		scanf("%d", &Max[rt]);
		return;
	}
	int mid = (l + r) >> 1;
	build(Lson); build(Rson);
	push_up(rt);
}

void update(int p, int pts, int l, int r, int rt)
{
	if (l == r)
	{
		Max[rt] = pts;
		return;
	}
	int mid = (l + r) >> 1;
	if (p <= mid)
		update(p, pts, Lson);
	else
		update(p, pts, Rson);
	push_up(rt);
}

int query(int L, int R, int l, int r, int rt)
{
	if (L <= l && r <= R)
	{
		return Max[rt];
	}
	int mid = (l + r) >> 1;
	int ret = 0;
	if (L <= mid)
	{
		ret = max(ret, query(L, R, Lson));
	}
	if (R > mid)
	{
		ret = max(ret, query(L, R, Rson));
	}
	return ret;
}
char c[2];
int main()
{
	int N,M;
	while (scanf("%d%d", &N, &M)!=EOF)
	{
		build(1, N, 1);
		int a, b;
		while (M--)
		{
			scanf("%s%d%d", c, &a, &b);
			if (c[0] == 'U')
			{
				update(a, b, 1, N, 1);
			}
			else if (c[0] == 'Q')
			{
				int ans;
				ans = query(a, b, 1, N, 1);
				printf("%d\n", ans);
			}
		}
	}
}