题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1754
思路:模板题,练手用吧。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<memory.h>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++) //[i,a);
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define LL __int64
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
using namespace std;
template<class T>
T Mint(T a, T b, T c) {
if (a>b) {
if (c>b)
return b;
return c;
}
if (c>a)
return a;
return c;
}
template<class T>
T Maxt(T a, T b, T c) {
if (a>b) {
if (c>a)
return c;
return a;
}
else if (c > b)
return c;
return b;
}
const int maxn=200010;
int T,n,m;
struct segTree{
int l,r;
int v;
}node[maxn*3+10];
void build(int id,int left,int right){
node[id].l=left;
node[id].r=right;
node[id].v=0;
if(left==right){
return ;
}
int mid=(left+right)/2;
build(id<<1,left,mid);
build(id<<1|1,mid+1,right);
}
void Update(int id,int pos,int add){
int l=node[id].l,r=node[id].r;
if(l==r){
node[id].v=add;
return ;
}
int mid=(l+r)/2;
if(mid>=pos)
Update(id<<1,pos,add);
else
Update(id<<1|1,pos,add);
node[id].v=max(node[id<<1].v,node[id<<1|1].v);
}
int Query(int id,int Qleft,int Qright){
int l=node[id].l,r=node[id].r;
if(l>=Qleft&&r<=Qright){
return node[id].v;
}
int mid=(l+r)/2;
if(mid>=Qright)
return Query(id<<1,Qleft,Qright);
else if(mid<Qleft)
return Query(id<<1|1,Qleft,Qright);
else{
int r1=Query(id<<1,Qleft,mid);
int r2=Query(id<<1|1,mid+1,Qright);
return max(r1,r2);
}
}
int main(){
#ifndef ONLINE_JUDGE
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
#endif
char ch;
int a,b;
while(~sfd(n,m)){
build(1,1,n);
for2(i,1,n){
sf(a);
Update(1,i,a);
}
while(m--){
getchar();
scanf("%c%d%d",&ch,&a,&b);
if(ch=='Q')
pf(Query(1,a,b));
if(ch=='U')
Update(1,a,b);
}
}
return 0;
}