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
akshay31057:
20170114 21:12:57
Excellent problem!!!!!go for structure array...


souvik23:
20170103 06:11:25
@gustavoaca1997 : The max size is 10^5 which is not a power of 2 ...... You have to take the nearest power of 2 greater than 10^5 i.e. 131072 and so your tree size must be 2*131072 which is > 2*10^5.That's why it didn't work:) 

lincolnbf:
20161007 01:51:21
gustavoaca the size of seg tree can go upto 4N for an array of size N. 

gustavoaca1997:
20160915 07:34:13
got RE because the size of my tree was 2 * 100000 + somethingElse. I chose that size because of theory of Segment Tree ("there are total 2 * n  1 nodes"). I had to put 3 * 100000. Can someone explain me why 2 * 100000 does not work? 

S. M. Shakir Ahsan Romeo:
20160726 20:15:45
Easy 

Dilpreet:
20160720 21:39:12
Take care of the space of the array and tree


iharsh234:
20160708 21:14:18
store max and its pos in a range.


lt:
20160707 12:13:24
Awesome! Ac in one shot :D 

Deepak :
20160630 13:54:19
AC on one go... i used N=100010 and for tree 4*N...easy Last edit: 20160630 13:54:34 

aryan_r:
20160625 16:57:22
There can be at most Q1 updates and last one might be a Query . So use N=2*10^5 :) else Run time error ! 
Added by:  Swarnaprakash 
Date:  20090110 
Time limit:  0.357s0.857s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JS NODEJS PERL 6 VB.net 
Resource:  Kurukshetra 09 OPC 