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
nilabja16180:
2017-03-02 09:06:57
AC in 3rd Go!
|
|
hasan356:
2017-01-16 10:39:04
my 50th |
|
siddharth_0196:
2016-12-27 16:02:22
GSS1 + update() = GSS3 ! |
|
shashi_92:
2016-11-06 06:27:05
what is wrong ans #0 please help. |
|
Anirban Acharya:
2016-10-14 11:59:25
what is wrong answer #1 ? |
|
davidgalehouse:
2016-10-04 01:46:31
For C# solvers: Input formatted incorrectly, sufficient to use Trim. |
|
avisheksanvas:
2016-08-04 22:10:06
Do GSS1 before this!
|
|
baadshah_:
2016-07-15 16:38:22
AC in one Go same as GSS1 with one update function |
|
iharsh234:
2016-07-09 18:01:56
implement using vector no chances of runtime error then. ^_^
|
|
Deepak :
2016-06-18 17:55:48
AC in one go.do GSS1 before this. |
Added by: | Bin Jin |
Date: | 2007-08-03 |
Time limit: | 1s |
Source limit: | 5000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: CPP |
Resource: | own problem |