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
atharva_sarage:
20180406 08:51:22
AC in first attempt!!! 

hrsh_sengar:
20180312 12:14:46
my 99th :) 

badboy_1496:
20180303 20:53:30
AC in one go!!!!


coolio_1:
20180301 11:57:56
AC in 1 go! Easy AF! 

ramini1996:
20180202 20:45:41
My 50th !!! AC in ONE GO !!! 

kushagra__k:
20180101 22:55:23
There can be 2 approaches here:


vijayrit:
20171220 00:36:46
Please do take sufficienty large array for the tree. Costed me four SIGSEGV errors.


rishabhm123:
20171217 18:54:04
AC in one go..Simple Segment tree with a slight variation of range min 

the_phoenixx:
20171215 16:30:41
Simple segment tree implementation!! 

grylls:
20171111 08:53:54
Nice Question...AC in one GO:) 
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 