TimeLimit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K(Java/Other)
Problem Description
Three pointsA(x1,y1), B(x2,y2) and C(x3,y3) form a arrow if and only if the followingconditions are fulfilled:
x1=x3<x2
y1<y2<y3
The length of the arrow(x2-x1) must not shorter than the width of the arrowy3-y1.
We define the size of an arrow as its length plus its width. Given N points inthe plane, what's the largest possible arrow can be formed from three of thegiven points.
Input
The first line ofthe input contains a positive integer T<=20 specifying the number of testcases to follow.
the first line of each test case contains a positive integerN(1<=N<=2000). Then follow N lines, each describes a point withcoodinates(xi,yi)(0<=xi,yi<=10^7).
It&#