KGSS  Maximum Sum
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
hide comments
sunil:
20151225 08:05:59
ac in first go 

gulshan_raj:
20151204 07:32:09
HeHe.. a single typo caused me more than 15 WA.


Prateek Agarwal:
20151130 11:19:00
My first Segment Tree :) 

Rajat Singh:
20150925 19:50:45
what is this??? how can N>10^5?? 

Rajat Singh:
20150925 19:50:44
what is this??? how can N>10^5?? 

:.Mohib.::
20150925 06:57:31
Awsm one....!! 

BRAIN:
20150924 19:14:03
Inteval tree :) fun 

[Mayank Pratap]:
20150905 16:14:45
Confidence in seg trees increasing day by day :) 

epsilon:
20150826 18:34:02
easy one :) 

GAURAV CHANDEL:
20150403 20:18:40
Best segment tree problem...

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