题解 | 最大 FST 距离

import sys

n = int(input())
A = list(map(int,input().split()))

s_list = []  # x_i + y_i
d_list = []  # x_i - y_i

for i in range(n):
    idx = i + 1  # i 从 1 开始
    x = idx * idx  # i^2
    y = A[i] * A[i]  # A_i^2
    s_list.append(x + y)
    d_list.append(x - y)

max_s = max(s_list)
min_s = min(s_list)
max_d = max(d_list)
min_d = min(d_list)

result = max(max_s - min_s, max_d - min_d)
print(result)

将表达式拆解