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 i-th 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
sujit yadav: 2015-10-22 00:49:08

same as gss1 bt have to add an extra "update" function ....

carofe82: 2015-10-19 01:46:08

I'm struggling with the IO in this problem.
I generate a random input of 50,000 integers from -10,000 to 10,000 and then I do 50,000 random operations with random numbers and positions and ranges. I'm testing this with the limits and my code, without the IO part finishes all that on average in 130ms. That gives a lot of room for the IO part. However, I'm getting TLE!
I tried BufferedReader and BufferedWriter to flush everything at the end. Also, I tried the Scanner. I suspect that part of the problem may be the formatting of the test case, my IO operations may be hanging waiting for inputs somewhere. I wish the author (or somebody from SPOJ) fixes the formatting to the test cases of this problem.
Anybody here with the same problem? Any advise?

Last edit: 2015-10-19 01:48:47
Habibur Rahman Habib: 2015-09-15 20:43:13

If the statement is "max{Ai, Ai+1 , .., Aj | x<=i<=j<=y }" . Please clear me someone. Thanks in Advances.

gandalf_: 2015-09-02 10:15:46

YOU SHALL NOT PASS
*******EDIT*******
hmmm, it passed....

Last edit: 2015-09-02 12:04:43
jas.py: 2015-08-25 12:01:59

there is some issue with spoj,,my same code got SIGSEGV#0 when submitted with C but passed with C++14

Last edit: 2015-08-25 12:02:28
shiva: 2015-08-05 15:10:37

Why wrong answer #0? Please help.

Abdullah mohammad fakhri al-attar: 2015-08-03 00:59:42

What is wrong answer #0

abhijeet: 2015-07-18 15:58:17

u need to solve gss1 first before attempting this one

Prismatic: 2015-06-27 18:34:47

Segment Tree did it easily !

SangKuan: 2015-06-20 05:23:49

if you got wrong answer #0,make the array more bigger


Added by:Bin Jin
Date:2007-08-03
Time limit:0.330s
Source limit:5000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: CPP
Resource:own problem