题意:
单点更新,区间查询最值。
思路:
线段树入门
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
#define lson root << 1, l, mid
#define rson root << 1 | 1, mid+1, r
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 200000+5;
using namespace std;
int n,m;
int Tree[maxn*4]; // 线段树
// 向上更新根节点
void push_up(int root){ Tree[root] = max(Tree[root<<1], Tree[root<<1 | 1]);}
// 线段树建树
void Stree_build(int root, int l, int r){
if(l == r){
scanf("%d", &Tree[root]);
//Tree[root] = a[cnt++];
//printf("cnt = %d, %d\n",cnt-1,a[cnt-1]);
return;
}
int mid = (l+r)>>1;
Stree_build(lson);
Stree_build(rson);
push_up(root);
}
// la、rb为需更新的区间左、右端点,l、r为当前区间左、右端点,root为当前l、r对应的根存储位置
void update(int la, int rb, int l, int r, int root, int val){
if(rb < l||la > r) return ; // 两区间无交集
if(la <= l&&rb >= r){ // [la,rb]包含[l,r]
Tree[root] = val; // 这里是覆盖更新,也可以选择其他的更新操作
return ;
}
int mid = (l+r)>>1;
if(la <= mid)
update(la, rb, l, mid, root<<1, val);
if(rb > mid)
update(la, rb, mid+1, r, root<<1 | 1, val);
push_up(root);
}
//查询区间[la,rb]的值
void Query(int la, int rb, int l, int r, int root, int& ans){
if(rb < l||la > r) return; // 两区间无交集
if(la <= l&&rb >= r){ ans = max(ans, Tree[root]); return; } // [la,rb]包含[l,r]
int mid = (l+r)/2;
if(la <= mid)
Query(la, rb, l, mid, root<<1, ans);
if(rb > mid)
Query(la, rb, mid+1, r, root<<1 | 1, ans);
push_up(root);
}
int main()
{
freopen("in.txt","r",stdin);
char str[5];
int x,y, ans;
while(scanf("%d%d",&n,&m) == 2){
memset(Tree, 0, sizeof(Tree));
Stree_build(1, 1, n);//建树
while(m--){
scanf("%s",str);
scanf("%d%d",&x,&y);
if(str[0] == 'U')
update(x, x, 1, n, 1, y);
else{
ans = 0;
Query(x, y, 1, n, 1, ans);
printf("%d\n", ans);
}
}
}
fclose(stdin);
return 0;
}