題干：

Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.

Let's suppose that your task is to build a square city. The world map uses the Cartesian coordinates. The sides of the city should be parallel to coordinate axes. The map contains mines with valuable resources, located at some points with integer coordinates. The sizes of mines are relatively small, i.e. they can be treated as points. The city should be built in such a way that all the mines are inside or on the border of the city square.

Building a city takes large amount of money depending on the size of the city, so you have to build the city with the minimum area. Given the positions of the mines find the minimum possible area of the city.

Input

The first line of the input contains number?n?— the number of mines on the map (2?≤?n?≤?1000). Each of the next?n?lines contains a pair of integers?xi?and?yi?— the coordinates of the corresponding mine (?-?109?≤?xi,?yi?≤?109). All points are pairwise distinct.

Output

Print the minimum area of the city that can cover all the mines with valuable resources.

Examples

Input

2 0 0 2 2

Output

4

Input

2 0 0 0 3

Output

9

題目大意：

給定一些點，要用盡量小的正方形框住所有的點，輸出矩形的大小。

解題報告：

? ?這題主要就是讀題的時候沒注意那個“正方形”，直到看到樣例，，其實題目中說的很清楚“Let's suppose that your task is to build a square city. ”。。。英文不及格好吧、、

AC代碼：

#include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<string> #include<cmath> #include<cstring> #define ll long long #define pb push_back #define pm make_pair using namespace std; const int MAX = 2e5 + 5; int n,x,y,a[MAX],ans; const ll INF = 0x3f3f3f3f3f; int main() {ll n,x,y,minx = INF,miny = INF,maxx = -INF,maxy = -INF;cin>>n;while(n--) {scanf("%lld%lld",&x,&y);minx = min(minx,x); maxx = max(maxx,x);miny = min(miny,y); maxy = max(maxy,y);} ll tmp = max((maxx-minx),(maxy-miny));printf("%lld\n", tmp*tmp);return 0; }

?

總結

以上是生活随笔為你收集整理的【CodeForces - 485B】Valuable Resources （贪心，水题，几何相关）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。