SPOJ GSS3 Can you answer these queries III

题意：

GSS1的基础上加上修改。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define N 100020
#define ls (i << 1)
#define rs (ls | 1)
#define md ((ll + rr) >> 1)

int n, sum[N*4], lx[N*4], rx[N*4], mx[N*4];

void push_up(int i) {
	sum[i] = sum[ls] + sum[rs];
	mx[i] = max(max(mx[ls], mx[rs]), rx[ls] + lx[rs]);
	lx[i] = max(lx[ls], sum[ls] + lx[rs]);
	rx[i] = max(rx[rs], sum[rs] + rx[ls]);
}
void build(int ll, int rr, int i) {
	if(ll == rr) {
		scanf("%d", &sum[i]);
		mx[i] = lx[i] = rx[i] = sum[i];
		return;
	}
	build(ll, md, ls);
	build(md + 1, rr, rs);
	push_up(i);
}
void update(int k, int v, int ll, int rr, int i) {
	if(ll == rr) {
		sum[i] = mx[i] = lx[i] = rx[i] = v;
		return;
	}
	if(k <= md) update(k, v, ll, md, ls);
	else update(k, v, md + 1, rr, rs);
	push_up(i);
}
int ql(int l, int r, int ll, int rr, int i) {
	if(ll == l && rr == r) return lx[i];
	if(r <= md) return ql(l, r, ll, md, ls);
	if(l > md) return ql(l, r, md + 1, rr, rs);
	return max(lx[ls], sum[ls] + ql(md + 1, r, md + 1, rr, rs));
}
int qr(int l, int r, int ll, int rr, int i) {
	if(ll == l && rr == r) return rx[i];
	if(r <= md) return qr(l, r, ll, md, ls);
	if(l > md) return qr(l, r, md + 1, rr, rs);
	return max(rx[rs], sum[rs] + qr(l, md, ll, md, ls));
}
int query(int l, int r, int ll, int rr, int i) {
	if(ll == l && rr == r) return mx[i];
	if(r <= md) return query(l, r, ll, md, ls);
	if(l > md) return query(l, r, md + 1, rr, rs);
	int R = qr(l, md, ll, md, ls);
	int L = ql(md + 1, r, md + 1, rr, rs);
	return max(L + R, max(query(l, md, ll, md, ls), query(md + 1, r, md + 1, rr, rs)));
}
int main() {
	while(scanf("%d", &n) != EOF) {
		build(1, n, 1);
		int m;
		scanf("%d", &m);
		while(m--) {
			int op, u, v;
			scanf("%d%d%d", &op, &u, &v);
			if(op == 0)
				update(u, v, 1, n, 1);
			else
				printf("%d\n", query(u, v, 1, n, 1));
		}
		return 0;
	}
	return 0;
}