



"""simple docstring"""


import math







class  A_     :



						"""simple docstring"""






						def __init__(   self					:Any  ,    lowercase_					:Optional[Any]   )							->     Tuple:
												UpperCAmelCase			 =					len(lowercase_   )
												UpperCAmelCase			 =					[0] * (
												    4 * self.N
												)  # approximate the overall size of segment tree with array N
												self.build(1  ,    0  ,    self.N - 1   )






						def       UpperCAmelCase__	(   self					:List[Any]  ,    lowercase_					:Optional[Any]   )							->     Union[str, Any]:
												return idx * 2






						def       UpperCAmelCase__	(   self					:Dict  ,    lowercase_					:Optional[Any]   )							->     int:
												return idx * 2 + 1






						def       UpperCAmelCase__	(   self					:str  ,    lowercase_					:Union[str, Any]  ,    lowercase_					:Tuple  ,    lowercase_					:Tuple   )							->     Dict:  # noqa: E741
												if l == r:
																		UpperCAmelCase			 =					A[l]
												else:
																		UpperCAmelCase			 =					(l + r) // 2
																		self.build(self.left(lowercase_   )  ,    lowercase_  ,    lowercase_   )
																		self.build(self.right(lowercase_   )  ,    mid + 1  ,    lowercase_   )
																		UpperCAmelCase			 =					max(self.st[self.left(lowercase_   )]  ,    self.st[self.right(lowercase_   )]   )






						def       UpperCAmelCase__	(   self					:Union[str, Any]  ,    lowercase_					:Union[str, Any]  ,    lowercase_					:Optional[Any]  ,    lowercase_					:Optional[Any]   )							->     Any:
												return self.update_recursive(1  ,    0  ,    self.N - 1  ,    a - 1  ,    b - 1  ,    lowercase_   )






						def       UpperCAmelCase__	(   self					:Any  ,    lowercase_					:Optional[Any]  ,    lowercase_					:int  ,    lowercase_					:List[Any]  ,    lowercase_					:List[Any]  ,    lowercase_					:List[str]  ,    lowercase_					:int   )							->     Dict:  # noqa: E741
												if r < a or l > b:
																		return True
												if l == r:
																		UpperCAmelCase			 =					val
																		return True
												UpperCAmelCase			 =					(l + r) // 2
												self.update_recursive(self.left(lowercase_   )  ,    lowercase_  ,    lowercase_  ,    lowercase_  ,    lowercase_  ,    lowercase_   )
												self.update_recursive(self.right(lowercase_   )  ,    mid + 1  ,    lowercase_  ,    lowercase_  ,    lowercase_  ,    lowercase_   )
												UpperCAmelCase			 =					max(self.st[self.left(lowercase_   )]  ,    self.st[self.right(lowercase_   )]   )
												return True






						def       UpperCAmelCase__	(   self					:List[str]  ,    lowercase_					:Tuple  ,    lowercase_					:List[str]   )							->     Dict:
												return self.query_recursive(1  ,    0  ,    self.N - 1  ,    a - 1  ,    b - 1   )






						def       UpperCAmelCase__	(   self					:Union[str, Any]  ,    lowercase_					:Tuple  ,    lowercase_					:Optional[int]  ,    lowercase_					:List[str]  ,    lowercase_					:int  ,    lowercase_					:List[Any]   )							->     Dict:  # noqa: E741
												if r < a or l > b:
																		return -math.inf
												if l >= a and r <= b:
																		return self.st[idx]
												UpperCAmelCase			 =					(l + r) // 2
												UpperCAmelCase			 =					self.query_recursive(self.left(lowercase_   )  ,    lowercase_  ,    lowercase_  ,    lowercase_  ,    lowercase_   )
												UpperCAmelCase			 =					self.query_recursive(self.right(lowercase_   )  ,    mid + 1  ,    lowercase_  ,    lowercase_  ,    lowercase_   )
												return max(lowercase_  ,    lowercase_   )






						def       UpperCAmelCase__	(   self					:str   )							->     Any:
												UpperCAmelCase			 =					[]
												for i in range(1  ,    N + 1   ):
																		show_list += [self.query(lowercase_  ,    lowercase_   )]
												print(lowercase_   )


if __name__ == "__main__":
				snake_case_								=			[1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
				snake_case_								=			15
				snake_case_								=			SegmentTree(A)
				print(segt.query(4, 6))
				print(segt.query(7, 11))
				print(segt.query(7, 12))
				segt.update(1, 3, 111)
				print(segt.query(1, 15))
				segt.update(7, 8, 235)
				segt.show_data()








"""simple docstring"""






from ..utils import DummyObject, requires_backends
class 	_lowerCAmelCase    (      metaclass=__snake_case       ):
							__lowerCAmelCase					:    Optional[Any]     =  ['''tensorflow_text''']

							def __init__( self       :    Optional[int] ,		*a       :    int ,		**a       :    str    )   ->    str:

									"""simple docstring"""
									requires_backends(self ,		['''tensorflow_text''']    )