1 #include <cstdio>
 2 #include <cstring>
 3 #include <iostream> 
 4 using namespace std;
 5 const int N=100010,inf=0x3f3f3f3f;
 6 int n,m,v[N*4],hv[N*4],a[N];
 7 char ch[10];
 8 struct node
 9 {
10     int a,b;
11     void clear(){ a=0,b=-inf; }
12     int calc(int x) { return max(x+a,b); }
13 }tag[N*4],ht[N*4];
14 node operator + (node x,node y) { return (node){max(-inf,x.a+y.a),max(x.b+y.a,y.b)}; }
15 node max(node x,node y) { return (node){max(x.a,y.a),max(x.b,y.b)}; }
16 void work(int d,node t1,node t2) { ht[d]=max(ht[d],tag[d]+t2),hv[d]=max(hv[d],t2.calc(v[d])),tag[d]=tag[d]+t1,v[d]=t1.calc(v[d]); }
17 void pushup(int d) { v[d]=max(v[d*2],v[d*2+1]),hv[d]=max(hv[d*2],hv[d*2+1]); }
18 void pushdown(int d) { work(d*2,tag[d],ht[d]),work(d*2+1,tag[d],ht[d]),tag[d].clear(),ht[d].clear(); }
19 void build(int d,int l,int r)
20 {
21     tag[d].clear(),ht[d].clear();
22     if (l==r) { v[d]=hv[d]=a[l]; return; }
23     int mid=l+r>>1;
24     build(d*2,l,mid),build(d*2+1,mid+1,r),pushup(d);
25 }
26 int query(int d,int op,int l,int r,int L,int R)
27 {
28     if (l<=L&&R<=r) return op?hv[d]:v[d];
29     int mid=L+R>>1,p=-inf; pushdown(d);
30     if (l<=mid) p=query(d*2,op,l,r,L,mid);
31     if (mid+1<=r) p=max(p,query(d*2+1,op,l,r,mid+1,R));
32     return p;
33 }
34 void change(int d,int l,int r,int L,int R,node k)
35 {
36     if (l<=L&&R<=r) { work(d,k,k); return; }
37     int mid=L+R>>1; pushdown(d);
38     if (l<=mid) change(d*2,l,r,L,mid,k);
39     if (mid+1<=r) change(d*2+1,l,r,mid+1,R,k);
40     pushup(d);
41 }
42 int main()
43 {
44     scanf("%d",&n);
45     for(int i=1;i<=n;i++) scanf("%d",&a[i]);
46     build(1,1,n),scanf("%d",&m);
47     for (int x,y,z;m;m--)
48     {
49         scanf("%s",ch),scanf("%d%d",&x,&y);
50         if (ch[0]==‘Q‘) printf("%d\n",query(1,0,x,y,1,n));
51         else if (ch[0]==‘A‘) printf("%d\n",query(1,1,x,y,1,n));
52         else if (ch[0]==‘P‘) scanf("%d",&z),change(1,x,y,1,n,(node){z,-inf});
53         else scanf("%d",&z),change(1,x,y,1,n,(node){-inf,z});
54     }
55 }