HDU 1754 I Hate It

http://acm.hdu.edu.cn/showproblem.php?pid=1754

常规线段树，将tree中的求和改成求max就行。

注意输入要循环，且判断EOF 

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<stack>
#include<sstream>
#include<fstream>
using namespace std;

const int maxn = 800000;
int tree[maxn], arr[maxn];
void build(int node, int start, int end) {
	if (start == end) {
		tree[node] = arr[start];
		return;
	}
	int mid = (start + end) / 2;
	build(2 * node + 1, start, mid);
	build(2 * node + 2, mid + 1, end);
	tree[node] = max(tree[2 * node + 1], tree[2 * node + 2]);
}
 
void update(int node, int start, int end, int idx, int val) {
	if (start == end && start == idx) {
		arr[idx] = val;//Note
		tree[node] = val;//Note
		return;
	}
	int mid = (start + end) / 2;
	int left_node = 2 * node + 1;
	int right_node = 2 * node + 2;
	if (idx >= start && idx <= mid)
		update(left_node, start, mid, idx, val);
	else
		update(right_node, mid + 1, end, idx, val);
	tree[node] = max(tree[left_node], tree[right_node]);
}


// 区间和查找，lr为查找范围，LR为线段树范围
int query_range(int node, int l, int r, int L, int R) {
	if (l <= L && r >= R)
		return tree[node];
	int mid = (L + R) / 2;
	int a, b;
	a = b = -0x3f3f3f3f;
	//当线段树范围[L,mid]和查找范围[l,r]有交集时
	if (mid >= l)
		a = query_range(node * 2 + 1, l, r, L, mid);
	if (mid < r)
		b = query_range(node * 2 + 2, l, r, mid + 1, R);
	return max(a, b);
}


int main()
{
	int n, m;
	while (scanf("%d%d", &n, &m) != EOF)
	{
		for (int i = 0; i < n; i++)
			scanf("%d", &arr[i]);
		build(0, 0, n - 1);
		int i, j;
		while (m--) {
			//cout << m << endl;
			char c;
			cin.get();
			scanf("%c%d%d", &c, &i, &j);
			if (c == 'Q')
			{
				cout << query_range(0, i - 1, j - 1, 0, n - 1) << endl;
			}
			if (c == 'U')
			{
				update(0, 0, n - 1, i - 1, j);
			}
		}
	}
	return 0;
}