13382：[Usaco2004 Open]Cave Cows 3 洞穴里的牛之三

最新推荐文章于 2024-10-02 23:40:03 发布

☈弑.

最新推荐文章于 2024-10-02 23:40:03 发布

阅读量119

点赞数 2

文章标签：算法 c++ 图论

本文链接：https://blog.csdn.net/HRC122449/article/details/141407744

版权

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef struct
{
	int x;
	int y;
}Point;
Point s[100005];
int main(void)
{
	int n, i, x, y, ans;
	scanf("%d", &n);
	for(i=1;i<=n;i++)
	{
		scanf("%d%d", &x, &y);
		s[i].x = x+y, s[i].y = x-y;
	}
	x = 10000000, y = 0;
	for(i=1;i<=n;i++)
		x = min(x, s[i].x), y = max(y, s[i].x);
	ans = y-x;
	x = 10000000, y = 0;
	for(i=1;i<=n;i++)
		x = min(x, s[i].y), y = max(y, s[i].y);
	ans = max(ans, y-x);
	printf("%d\n", ans);
	return 0;
}