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].
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 the maximum sum mentioned above, in a separate line, for each Query.
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
|
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) |
|
epsilonalpha: 2017-04-11 01:03:04 AC in one go. Recommended! |
|
alaa seb: 2017-03-24 23:46:21 my first segment tree .. AC in one go :) |
|
shahzada: 2017-03-14 13:56:05 RE(SIGSEGV) - Scanf |