import math





class 					__snake_case    :




					def __init__(  self       ,			__UpperCamelCase						)	->    Dict:



									'''simple docstring'''







									snake_case__   :      Optional[int]   				= len(__UpperCamelCase						)
									snake_case__   :      Dict   				= [0] * (
									    4 * self.N
									)  # approximate the overall size of segment tree with array N
									self.build(1       ,			0       ,			self.N - 1						)




					def      __a     (  self       ,			__UpperCamelCase						)	->    Any:



									'''simple docstring'''







									return idx * 2




					def      __a     (  self       ,			__UpperCamelCase						)	->    Optional[int]:



									'''simple docstring'''







									return idx * 2 + 1




					def      __a     (  self       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)	->    int:  # noqa: E741



									'''simple docstring'''







									if l == r:
													snake_case__   :      Dict   				= A[l]
									else:
													snake_case__   :      Optional[Any]   				= (l + r) // 2
													self.build(self.left(__UpperCamelCase						)       ,			__UpperCamelCase       ,			__UpperCamelCase						)
													self.build(self.right(__UpperCamelCase						)       ,			mid + 1       ,			__UpperCamelCase						)
													snake_case__   :      int   				= max(self.st[self.left(__UpperCamelCase						)]       ,			self.st[self.right(__UpperCamelCase						)]						)




					def      __a     (  self       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)	->    int:



									'''simple docstring'''







									return self.update_recursive(1       ,			0       ,			self.N - 1       ,			a - 1       ,			b - 1       ,			__UpperCamelCase						)




					def      __a     (  self       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)	->    Tuple:  # noqa: E741



									'''simple docstring'''







									if r < a or l > b:
													return True
									if l == r:
													snake_case__   :      List[str]   				= val
													return True
									snake_case__   :      str   				= (l + r) // 2
									self.update_recursive(self.left(__UpperCamelCase						)       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)
									self.update_recursive(self.right(__UpperCamelCase						)       ,			mid + 1       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)
									snake_case__   :      Tuple   				= max(self.st[self.left(__UpperCamelCase						)]       ,			self.st[self.right(__UpperCamelCase						)]						)
									return True




					def      __a     (  self       ,			__UpperCamelCase       ,			__UpperCamelCase						)	->    List[str]:



									'''simple docstring'''







									return self.query_recursive(1       ,			0       ,			self.N - 1       ,			a - 1       ,			b - 1						)




					def      __a     (  self       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)	->    Optional[int]:  # noqa: E741



									'''simple docstring'''







									if r < a or l > b:
													return -math.inf
									if l >= a and r <= b:
													return self.st[idx]
									snake_case__   :      str   				= (l + r) // 2
									snake_case__   :      Optional[Any]   				= self.query_recursive(self.left(__UpperCamelCase						)       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)
									snake_case__   :      List[str]   				= self.query_recursive(self.right(__UpperCamelCase						)       ,			mid + 1       ,			__UpperCamelCase       ,			__UpperCamelCase       ,			__UpperCamelCase						)
									return max(__UpperCamelCase       ,			__UpperCamelCase						)




					def      __a     (  self						)	->    Optional[Any]:



									'''simple docstring'''







									snake_case__   :      Tuple   				= []
									for i in range(1       ,			N + 1						):
													show_list += [self.query(__UpperCamelCase       ,			__UpperCamelCase						)]
									print(__UpperCamelCase						)


if __name__ == "__main__":
				lowerCAmelCase__	:  Optional[int]						=  [1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
				lowerCAmelCase__	:  Any						=  15
				lowerCAmelCase__	:  List[Any]						=  SegmentTree(A)
				print(segt.query(4, 6))
				print(segt.query(7, 11))
				print(segt.query(7, 12))
				segt.update(1, 3, 1_11)
				print(segt.query(1, 15))
				segt.update(7, 8, 2_35)
				segt.show_data()



from ...utils import is_transformers_available
from .pipeline_latent_diffusion_superresolution import LDMSuperResolutionPipeline


if is_transformers_available():
				from .pipeline_latent_diffusion import LDMBertModel, LDMTextToImagePipeline


