1671.三角形

include [HTML_REMOVED]

include [HTML_REMOVED]

int main()
{
int n,i,j,k;
int maxx,maxy,max=0;
scanf(“%d”,&n);
int x[n],y[n];
for(i=0;i[HTML_REMOVED]maxy)
maxy=abs(y[j]-y[i]);
}
for(k=0;k[HTML_REMOVED]maxx)
maxx=abs(x[k]-x[i]);
}
if((maxxmaxy)>max)
max=(maxxmaxy);
}
printf(“%d”,max);
return 0;
}