# Max In A Interval - Range Query Point Update #### Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

`You are given an array(of integers) of length n.You are required to answer q queries.Queries can be of two types0. 0 pos val : In this you have to update arr[pos] to val.1. 1 l r: In this query u have to find the max among all elements in this interval.To do the above task u have to create a datastructure as follows :-Implement the SegmentTree class:1. SegmentTree(int arr[]): Initializes the SegmentTree object with an array,2. void update(int pos, int val): updates the arr[pos] to val,3. int query(int l, int r): return max of all element's in interval [l, r].Can u do it in O(log(n)) or better Time Complexity.`
Input Format
`A number nn1n2.. n number of elementsA number qfollowing q lines contains queries of format either of two 0 pos val,1 l r`
Output Format
`for each query print a single integer in seperate line`
Question Video
Constraints
`1. 1 <= n, q <= 10^52. 0 <= l <= r < n3. 10^9 <= arr[i] <= 10^94. all input and output will fit in 32bit signed integer`
Sample Input
`41234101 0 30 1 31 0 31 1 20 2 51 2 21 2 31 0 11 0 21 1 3`
Sample Output
`44355355`

• Related Topics

Run

Run
Id Name