一、2个注意事项
二、AC代码
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e3+5;
int n;
struct node
{
long long x;
long long y;
}solve[maxn];
bool cmpx( node a, node b )
{
return a.x<b.x;
}
bool cmpy(node a, node b)
{
return a.y<b.y;
}
int main()
{
while( ~scanf("%d",&n) )
{
int loop=n;
while( loop-- )
{
scanf("%lld%lld",&solve[loop].x , &solve[loop].y );
}
sort( solve, solve+n, cmpx );
long long x=solve[n-1].x-solve[0].x;
sort( solve, solve+n, cmpy );
long long y=solve[n-1].y-solve[0].y;
long long num=max( x, y );
printf("%lld\n", num*num );
}
return 0;
}