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
paradise_lost:
20170623 11:48:14
AC in one go B 

semsoft:
20170618 15:56:43
good problem :) Last edit: 20170618 16:33:26 

mkfeuhrer:
20170606 14:25:36
try gss1 first then just add update !! Last edit: 20170606 14:30:50 

you_know_who15:
20170522 21:12:14
can anyone tell me how the 3rd query given 4 instead of 3? 

syamphanindra:
20170504 20:47:49
hey finally after long frustation for a week solved gss1 and gss3 

ace_of_spades:
20170430 22:15:50
silly mistake > one week of frustration


rohit9934:
20170403 16:10:22
Last edit: 20170405 20:51:17 

jedyn:
20170327 18:07:24
cant pass gss1 in java but works in gss3 : 

scorpion_ajay:
20170324 16:47:34
AC in a go, do GSS1 before this!! 

nilabja16180:
20170302 09:06:57
AC in 3rd Go!

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 