题解 | 最大 FST 距离

#include <iostream>
using namespace std;
#include<algorithm>
#include<cmath>
#include<vector>
int main(){
int n;
cin>>n;
vector<long long>a;
vector<long long>b;
for(long long i=1;i<=n;i++){
long long c;
cin>>c;
a.push_back(c*c+i*i);
b.push_back(c*c-i*i);





}
sort(a.begin(),a.end());
sort (b.begin(),b.end());
long long d=a[n-1]-a[0];
long long e=b[n-1]-b[0];
long long f=max(d,e);
cout<<f;



    return 0;
}