5 6
1 2 3 4 5
Q 1 5
U 3 6
Q 3 4
Q 4 5
U 2 9
Q 1 5
5
6
5
9
Hint
Huge input,the C function scanf() will work better than cin
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=200000+5;
using namespace std;
int a[maxn*4];
const int INF=0x3f3f3f3f;
void PushUp(int i)
{
a[i]=max(a[i*2],a[i*2+1]);
}
void build(int i,int l,int r)
{
if(l==r)
{
scanf("%d",&a[i]);
return;
}
int m=(l+r)/2;
build(i*2,l,m);
build(i*2+1,m+1,r);
PushUp(i);
}
int query(int ql,int qr,int i,int l,int r)
{
if(ql<=l&&r<=qr)
return a[i];
int m=(l+r)/2;
int maxx=-INF;
if(ql<=m)
maxx=max(maxx,query(ql,qr,i*2,l,m));
if(qr>m)
maxx=max(maxx,query(ql,qr,i*2+1,m+1,r));
return maxx;
}
void update(int id,int val,int i,int l,int r)
{
if(l==r)
{
a[i]=val;
return;
}
int m=(l+r)/2;
if(id<=m)
update(id,val,i*2,l,m);
else
update(id,val,i*2+1,m+1,r);
PushUp(i);
}
int main()
{
int n,m;
char str[10];
int x,y;
while(cin>>n>>m)
{
build(1,1,n);
while(m--)
{
scanf("%s%d%d",str,&x,&y);
if(str[0]=='Q')
printf("%d\n",query(x,y,1,1,n));
else
update(x,y,1,1,n);
}
}
return 0;
}