heartlessly / heartlessly.github.io

A blog for Heartlessly
1 stars 0 forks source link

「BZOJ 3382」「USACO04OPEN」Cave Cows 3 洞穴里的牛之三 | Heartlessly's Blog #146

Open heartlessly opened 5 years ago

heartlessly commented 5 years ago

https://heartlessly.github.io/problems/bzoj-3382/

Description给定 $n$ 个点,每个点的坐标为 $(x,y)$,求曼哈顿距离的最大点对,输出这个最大值。 $(1 \leq n \leq 5 \times 10^4,-10^6 \leq x,y \leq 10^6)$