1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
using namespace std;
const int maxn=10007;
const int inf=2147483640;
int n,m,x[maxn];
struct data{
int lt,rt,val,tag;
}tr[maxn<<2];
void pushdown(int id) {
if (tr[id].lt==tr[id].rt) return;
tr[id*2].val=max(tr[id*2].val,tr[id].tag);
tr[id*2+1].val=max(tr[id*2+1].val,tr[id].tag);
tr[id*2].tag=tr[id].tag;
tr[id*2+1].tag=tr[id].tag;
tr[id].tag=0;
}
void build(int id,int l,int r){
tr[id].lt=l; tr[id].rt=r;
if (l==r) {tr[id].val=x[l]; return;}
int mid=(l+r) >> 1;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
tr[id].val=max(tr[id*2].val,tr[id*2+1].val);
}
void change(int id,int l,int r,int v) {
int nowl=tr[id].lt,nowr=tr[id].rt;
if (l<=nowl && nowr<=r) {
tr[id].val=v;
tr[id].tag=v;
pushdown(id);
return;
}
if (nowr<l || r<nowl) return;
change(id*2,l,r,v); change(id*2+1,l,r,v);
tr[id].val=max(tr[id*2].val,tr[id*2+1].val);
}
int query(int id,int l,int r) {
int nowl=tr[id].lt,nowr=tr[id].rt;
pushdown(id);
if (l<=nowl && nowr<=r) return tr[id].val;
if (nowr<l || r<nowl) return -inf;
return max(query(id*2,l,r),query(id*2+1,l,r));
}
int (){
ios::sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>x[i];
build(1,1,n);
cin>>m;
while (m--) {
char now; int p,q,r;
cin>>now;
if (now=='C') { //Change
cin>>p>>q>>r;
change(1,p,q,r);
}
else { //Query
cin>>p>>q;
cout<<query(1,p,q)<<endl;
}
}
return 0;
}
|
近期评论