求所有点中最远的哈曼顿距离
思路:哈曼顿距离是|Xa-Xb|+|Ya-Yb|,整理得到(Xa+Ya)-(Xb+Yb), -(Xa+Ya)+(Xb+Yb),(Xa-Ya)-(Xb-Yb),-(Xa-Ya)+(Xb-Yb),
(Xa+Ya)-(Xb+Yb), -(Xa+Ya)+(Xb+Yb),因为Xa会遍历全部点,合并为(xa+ya)-(xb+yb);
(Xa-Ya)-(Xb-Yb),-(Xa-Ya)+(Xb-Yb),因为Xa会遍历全部点,合并为(xa-ya)-(xb-yb);
所以最大曼哈顿距离=max((xa+ya)-(xb+yb),(xa-ya)-(xb-yb))
long long a1=b1=-1e9,a2=b2=1e9;
for(int i=0;i<n;i++){
a1=max(a1,x[i]+y[i]),a2=min(a2,x[i]+y[i]);
b1=max(b1,x[i]-y[i]),b2=min(b2,x[i]-y[i]);
}
long long ans=max(a1-a2,b1-b2);