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
chefpr7: 2020-07-02 09:09:33

AC in One Go!! Nice practice problem for newbies!

wargang: 2020-07-01 13:25:12

very nice problem!!

sarthak_19: 2020-06-29 06:21:49

AC in one GO!!!!!!!!
Good for Beginners

amitesh200: 2020-06-23 23:39:33

nice one for those who are beginners in segment tree..

noobbbbbb: 2020-05-29 20:30:11

AC in second go

dhruvgheewala: 2020-05-25 20:53:11

Good Question For Segment Tree Beginners.

Last edit: 2020-05-25 20:53:51
amar_shukla1: 2020-05-18 13:30:23

easy question,But it took me 2 hours and I understood that my implementation was shit.

abhishek_251: 2020-04-29 10:43:31

0.06

fighter_4: 2020-04-26 07:16:20

just little bit tricky,but can be done easily ,, one go ,in 0.06 :D,

pas7582128: 2019-12-26 07:47:43

This one is easiest segment tree problem. Best for newbies.


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