Submission #54193961

---

Source Code Expand

# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect,bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from sortedcontainers import SortedList,SortedSet
def input():return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
mod = 998244353
#//////////////////////////////////
N = ii()
Z,W = list(),list()
for _ in range(N):
  x,y = ms()
  Z.append(x+y)
  W.append(x-y)
print(max(max(Z)-min(Z),max(W)-min(W)))

Submission Info

Judge Result