KGSS - Maximum Sum


You are given a sequence A[1], A[2], ..., A[N] ( 0 ≤ A[i] ≤ 10^8 , 2 ≤ N ≤ 10^5 ). There are two types of operations and they are defined as follows:

Update:

This will be indicated in the input by a 'U' followed by space and then two integers i and x.

U i x, 1 ≤ i ≤ N, and x, 0 ≤ x ≤ 10^8.

This operation sets the value of A[i] to x.

Query:

This will be indicated in the input by a 'Q' followed by a single space and then two integers i and j.

Q x y, 1 ≤ x < y ≤ N.

You must find i and j such that x ≤ i, j ≤ y and i != j, such that the sum A[i]+A[j] is maximized. Print the sum A[i]+A[j].

Input

The first line of input consists of an integer N representing the length of the sequence. Next line consists of N space separated integers A[i]. Next line contains an integer Q, Q ≤ 10^5, representing the number of operations. Next Q lines contain the operations.

Output

Output the maximum sum mentioned above, in a separate line, for each Query.

Example

Input:
5
1 2 3 4 5
6
Q 2 4
Q 2 5
U 1 6
Q 1 5
U 1 7
Q 1 5

Output:
7
9
11
12

Warning: large Input/Output data, be careful with certain languages

hide comments
grylls: 2017-11-11 08:53:54

Nice Question...AC in one GO:)

ramprosad: 2017-10-30 06:40:43

Input limit 10^8 , but for integer data type verdict is runtime error ??? What's amaging!!!!!

vicky_1998: 2017-10-29 06:29:18

AC IN ONE GO!!!
Was an easy one, added experience with segment tree though

da_201501181: 2017-09-14 11:52:22

AC in ONE GO..!!! Nice implementation category question

VENUKANT SAHU: 2017-09-12 13:28:16

AC in one go :)

scorpion_ajay: 2017-09-11 22:22:34

@bhagirathi08 no we don't need lazy, it is only needed in update range sort of questions...

nikhil2504: 2017-08-02 18:08:13

Last edit: 2017-08-02 19:09:33
bhagirathi08: 2017-07-31 08:59:16

Do we need LAZY propagation?

ajeyo: 2017-05-27 18:18:22

AC in one GO! :D Probably the very first time :P

lord_poseidon: 2017-05-27 10:31:39

why not working if the size of tree set to be 2 * n + 10(as minimum no of elements needed are 2 * n - 1 for the tree)


Added by:Swarnaprakash
Date:2009-01-10
Time limit:0.357s-0.857s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Kurukshetra 09 OPC