DISTANCE - Manhattan
The L1 distance of two d-dimensional points is the sum of absolute values of their coordinate differences (i.e. Σi=1d |xi - yi| for two points x,y). Given N points in the plane you must find the farthest pair of points under the L1 distance metric and output their distance.
The first line of the input is "N d" (2 ≤ N ≤ 100000, 1 ≤ d ≤ 6) signifying that there are N points in d-dimensional space. N lines then follow, where the ith line is a space-separated list of d numbers, the coordinates of the ith point. All given coordinates are integers that are at most 1000000 in absolute value, and all given points are distinct.
Your output should consist of a single integer, the farthest distance between a pair of input points, followed by a newline.
Input: 3 2 0 0 -5 0 1 1 Output: 7
Surprised my solution was accepted immediately, very cool problem
Nice problem :)