题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1754
两道题过后,我发觉线段树单点更新裸写法我已经能写个差不多了,继续膜拜notonlysuccess大神
再做,再做,直到形成了我自己的模版深深刻在我脑子里为止!!
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn = 200000;
int MAX[maxn << 2];
void PushUp(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 m = (l + r) >> 1;
build(l, m, rt << 1);
build(m + 1, r, rt << 1 | 1);
PushUp(rt);
}
void update(int p, int t, int l, int r, int rt)
{
if (l == r)
{
MAX[rt] = t;
return;
}
int m = (l + r) >> 1;
if (p <= m) update(p, t, l, m, rt << 1);
else update(p, t, m + 1, r, rt << 1 | 1);
PushUp(rt);
}
int query(int ll, int rr, int l, int r, int rt)
{
if (ll <= l && rr >= r) return MAX[rt];
int m = (l + r) >> 1;
int ret = 0;
if (ll <= m) ret = max(ret, query(ll, rr, l, m, rt << 1));
if (rr > m) ret = max(ret, query(ll, rr, m + 1, r, rt << 1 | 1));
return ret;
}
int main()
{
int n, m;
while (scanf("%d%d", &n, &m) != EOF)
{
char c;
int x, y;
build(1, n, 1);
while(m--)
{
scanf("\n%c %d%d", &c, &x, &y);
if (c == 'U') update(x, y, 1, n, 1);
if (c == 'Q')
{
int ans = query(x, y, 1, n, 1);
printf("%d\n", ans);
}
}
}
return 0;
}