(线段树)HUD 1754 I Hate It

1754 I Hate It

题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1754
挺多自己粗心大意的地方，下面都备注了

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef struct Node {
	int l, r;
	int m;
	//Node(int ll, int rr, int mm):l(ll),r(rr),m(mm){}
}node;
int a[200010];
node tr[200010*4];//注意要扩展四倍即<<2;
void pushup(int u) {
	tr[u].m = max(tr[u << 1].m, tr[u << 1 | 1].m);
}
void build(int u, int l, int r) {
	node te;
	te.l = l; te.r = r;
	tr[u] = te;
	if (l == r) {
		tr[u].m = a[l];
	}
	else {
		int mid = (l + r) >> 1;
		build(u << 1, l, mid);
		build(u << 1 | 1, mid + 1, r);
		pushup(u);
	}

}
void change(int u,int x,int score) {//改变就是找到最底层的点,然后依次向上修改最大值。
    if(tr[u].r==tr[u].l){
		tr[u].m = score;
		return;
    }
	int mid = (tr[u].l + tr[u].r)>>1;
	if(x<=mid){
		change(u<<1, x, score);

	}
	else {
		change(u<<1|1, x, score);

	}
	pushup(u);

}
int query(int u,int x, int y) {
	int temp = 0;
	if (tr[u].l >= x && tr[u].r <= y) {//查询，只需要某段在x,y之间即可
		temp =tr[u].m;
	}
	else {
		int mid = tr[u].r + tr[u].l >> 1;

		if (x <= mid) temp = max(temp, query(u << 1, x, y));//原理和上面的解释一样
		if (y > mid) temp = max(temp, query(u << 1 | 1, x, y));

	}
	return temp;
}
int main() {
	int n, m;
	while (~scanf("%d %d", &n, &m) ) {
            //cout<<n<<" "<<m<<endl;
            memset(a,0,sizeof a);//如果下面build,query ,change的函数n换成200010，则要加上这两个置0。
            memset(tr,0,sizeof tr);
		for (int i = 1; i <= n; i++)//因为学生编号是1~n,所以i初值不能为0
			scanf("%d", &a[i]);

		build(1, 1,n);
		char ch;
		int x, y;
		for (int i = 0; i < m; i++) {

			scanf("%*c%c %d %d",&ch,&x,&y);//习惯了cin,cout，scanf这里要处理\n的影响
			//cout<<ch<<x<<y<<endl;
			if (ch== 'Q') {
				printf("%d\n", query(1, x, y));
			}
			else {
				change(1,x, y);
			}
		}
	}
	return 0;
}