GSS3  Can you answer these queries III
You are given a sequence A of N (N <= 50000) integers between 10000 and 10000. On this sequence you have to apply M (M <= 50000) operations:
modify the ith element in the sequence or for given x y print max{Ai + Ai+1 + .. + Aj  x<=i<=j<=y }.
Input
The first line of input contains an integer N. The following line contains N integers, representing the sequence A1..AN.
The third line contains an integer M. The next M lines contain the operations in following form:
0 x y: modify Ax into y (y<=10000).
1 x y: print max{Ai + Ai+1 + .. + Aj  x<=i<=j<=y }.
Output
For each query, print an integer as the problem required.
Example
Input: 4 1 2 3 4 4 1 1 3 0 3 3 1 2 4 1 3 3 Output: 6 4 3
hide comments
vk1999:
20180706 11:06:48
This is a very nice problem for someone who wants a good foundational problem in segment trees. Thanks! 

zephyr_96:
20180307 08:45:17
For java, use fast I/O. If the size of your file exceeds 5000 bytes, use java code minifier to remove spaces and newlines.


alter123:
20180121 06:53:00
Did anyone ever solved this in JAVA??? 

senacoder111:
20180103 16:50:28
kgss + gss1 = gss3


yogi10:
20171214 10:36:35
can anybody explain the 3rd query why output is 4 please 

hitesh87:
20171203 18:19:23
Easy after doing gss1 first. 

anurag_tangri:
20171125 07:11:08
GSS! + point update=AC! 

anubhav25:
20171010 13:33:06
finally did it......:)


pratham_1:
20171004 17:01:06
How come my same java code gives TLE to gss1 ,but pass gss3 ;) 

javafreak:
20170928 03:20:36
Everybody getting stuck here, please try GSS1 before this , after that this question will be a breeze for you :) 
Added by:  Bin Jin 
Date:  20070803 
Time limit:  0.330s 
Source limit:  5000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: CPP 
Resource:  own problem 