A28592. 函数 def find_max(arr, low, high): 计算数组中最大元素，其中数组 arr 从索引 low 到 high ，（ ）正确实现了分治逻辑。

def find_max(arr, low, high):
	if low = high:
		return arr[low]
	mid = low + (high - low) // 2
	left_max = find_max(arr, low, mid)
	right_max = find_max(arr, mid, high)
	return left_max if left_max > right_max else right_max

def find_max(arr, low, high):
	if low == high:
		return arr[low]
	mid = low + (high - low) // 2
	left_max = find_max(arr, low, mid)
	right_max = find_max(arr, mid, high)
	return left_max if left_max > right_max else right_max

def find_max(arr, low, high):
	if low == high:
		return arr[low]
	mid = low + (high - low) // 2
	left_max = find_max(arr, low, mid)
	right_max = find_max(arr, mid - 1, high)
	return left_max if left_max > right_max else right_max

def find_max(arr, low, high):
	if low == high:
		return arr[low]
	mid = low + (high - low) // 2
	left_max = find_max(arr, low, mid)
	right_max = find_max(arr, mid + 1, high)
	return left_max if left_max > right_max else right_max