python洛谷p1678

根据引用[2]提供的信息，洛谷P1678是一个关于二分查找的问题。在这个问题中，我们需要找到一个学生i（分数为b[i]）最适合的（差值最小）学校。在解决这个问题时，需要注意使用函数（例如sort、lower_bound等）时，要确保对应的数组范围正确。

以下是一个示例代码，演示了如何使用二分查找解决洛谷P1678问题：

def binary_search(arr, target):
    left = 0
    right = len(arr) - 1

    while left <= right:
        mid = (left + right) // 2

        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1

    return -1

def find_best_school(students, scores, target_score):
    min_diff = float('inf')
    best_school = -1

    for i in range(len(students)):
        diff = abs(scores[i] - target_score)

        if diff < min_diff:
            min_diff = diff
            best_school = students[i]

    return best_school

# 示例输入
students = [1, 2, 3, 4, 5]
scores = [90, 85, 95, 80, 90]
target_score = 88

# 对分数进行排序
sorted_scores = sorted(scores)

# 使用二分查找找到最接近目标分数的学生
index = binary_search(sorted_scores, target_score)

# 如果找到了最接近的分数
if index != -1:
    target_student = students[scores.index(sorted_scores[index])]
    best_school = find_best_school(students, scores, sorted_scores[index])
    print("最接近目标分数的学生是：", target_student)
    print("最适合的学校是：", best_school)
else:
    print("没有找到最接近目标分数的学生")