N维曼哈顿距离 传送门:http://blog.csdn.net/taozifish/article/details/7574294
//省赛F题 Manhattan
//三维点集求最远曼哈顿距离
#include<iostream>
#include<cstdio>
const int MAX=1000001;
const int MIN=-1000001;
using namespace std;
int n,d;
int onemaxdistance() //一维点集最大曼哈顿距离
{
int max1=MIN,min1=MAX,x,ans;
for(int i=1;i<=n;++i)
{
scanf("%d",&x);
if(x>max1) max1=x;
if(x<min1) min1=x;
}
ans=max1-min1;
return ans;
}
int twomaxdistance() //二维点集最大曼哈顿距离
{
int max1=MIN,min1=MAX,max2=MIN,min2=MAX,x,y,ans;
for(int i=1;i<=n;++i)
{
scanf("%d%d",&x,&y);
if(x+y>max1) max1=x+y;
if(x+y<min1) min1=x+y;
if(x-y>max2) max2=x-y;
if(x-y<min2) min2=x-y;
}
ans=max1-min1;
if(max2-min2>ans) ans=max2-min2;
return ans;
}
int threemaxdistance() //三维点集最大曼哈顿距离
{
int max1=MIN,min1=MAX,max2=MIN,min2=MAX,max3=MIN,min3=MAX,max4=MIN,min4=MAX,x,y,z,ans;
for(int i=1;i<=n;++i)
{
scanf("%d%d%d",&x,&y,&z);
if(x+y+z>max1) max1=x+y+z;
if(x+y+z<min1) min1=x+y+z;
if(x-y+z>max2) max2=x-y+z;
if(x-y+z<min2) min2=x-y+z;
if(x+y-z>max3) max3=x+y-z;
if(x+y-z<min3) min3=x+y-z;
if(x-y-z>max4) max4=x-y-z;
if(x-y-z<min4) min4=x-y-z;
}
ans=max1-min1;
if(max2-min2>ans) ans=max2-min2;
if(max3-min3>ans) ans=max3-min3;
if(max4-min4>ans) ans=max4-min4;
return ans;
}
int main()
{
int Test;
scanf("%d",&Test);
while(Test--)
{
scanf("%d%d",&n,&d); //输入点数、维数
if(d==1)
printf("%d",onemaxdistance());
else if(d==2)
printf("%d",twomaxdistance());
else if(d==3)
printf("%d",threemaxdistance());
}
return 0;
}