LA 1453 旋转卡壳

最新推荐文章于 2024-08-14 21:22:15 发布

Tczxw

最新推荐文章于 2024-08-14 21:22:15 发布

阅读量290

点赞数

本文链接：https://blog.csdn.net/tczxw/article/details/49643491

版权

#include <bits/stdc++.h>
using namespace std;
struct Point
{
	double x, y;
	Point(double x = 0, double y = 0): x(x), y(y) {}
};
typedef Point Vector;
int Cross(Vector A, Vector B)
{
	return A.x * B.y - A.y * B.x;
}
Vector operator +(Vector A, Vector B)//
{
	return Vector(A.x + B.x, A.y + B.y);
}
Vector operator -(Point A, Point B)//
{
	return Vector(A.x - B.x , A.y - B.y);
}
Vector operator *(Vector A, double p)//
{
	return Vector(A.x * p, A.y * p);
}
Vector operator /(Vector A, double p)//
{
	return Vector(A.x / p, A.y / p);
}
bool operator <(const Point &a, const Point &b)//
{
	return a.x < b.x || (a.x == b.x && a.y < b.y);
}
const double eps = 1e-10;
int dcmp(double x)//
{
	if (fabs(x) < eps) return 0;
	else return x < 0 ? -1 : 1;
}
bool operator ==(const Point &a, const Point &b)//
{
	return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
double Dot(Vector A, Vector B)//
{
	return A.x * B.x + A.y * B.y;
}
int Dist2(const Point &A, const Point &B)
{
	return (A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y);
}
vector<Point> ConvexHull(vector<Point>& p)
{
	sort(p.begin(), p.end());
	p.erase(unique(p.begin(), p.end()), p.end());

	int n = p.size();
	int m = 0;
	vector<Point> ch(n + 1);
	for (int i = 0; i < n; i++)
	{
		while (m > 1 && Cross(ch[m - 1] - ch[m - 2], p[i] - ch[m - 2]) <= 0) m--;
		ch[m++] = p[i];
	}
	int k = m;
	for (int i = n - 2; i >= 0; i--)
	{
		while (m > k && Cross(ch[m - 1] - ch[m - 2], p[i] - ch[m - 2]) <= 0) m--;
		ch[m++] = p[i];
	}
	if (n > 1) m--;
	ch.resize(m);
	return ch;
}
int getMaxDirmater(vector<Point>&points)
{
	vector<Point>p = ConvexHull(points);
	int n = p.size();
	if (n == 1) return 0;
	if (n == 2) return Dist2(p[0], p[1]);
	p.push_back(p[0]);
	int ans = 0;
	for (int u = 0, v = 1; u < n; u++)
	{
		for (;;)
		{
			int diff = Cross(p[u + 1] - p[u], p[v + 1] - p[v]);
			if (diff <= 0)
			{
				ans = max(ans, Dist2(p[u], p[v]));
				if (diff == 0) ans = max(ans, Dist2(p[u], p[v + 1]));
				break;
			}
			v = (v + 1) % n;
		}
	}
	return ans;
}
int T, n, kase, x, y, z;
int main(int argc, char const *argv[])
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		vector<Point>points;
		for (int i = 0; i < n; i++)
		{
			scanf("%d%d%d", &x, &y, &z);
			points.push_back(Point(x, y));
			points.push_back(Point(x + z, y));
			points.push_back(Point(x, y + z));
			points.push_back(Point(x + z, y + z));
		}
		printf("%d\n", getMaxDirmater(points));
	}
	return 0;
}

凸多边形直径

我们将一个多边形上任意两点间的距离的最大值定义为多边形的直径。确定这个直径的点对数可能多于一对。事实上，对于拥有 n 个顶点的多边形，就可能有 n 对“直径点对”存在。

一个多边形直径的简单例子如左图所示。直径点对在图中显示为被平行线穿过的黑点（红色的一对平行线）. 直径用浅蓝色高亮显示。

显然，确定一个凸多边形 P 直径的点对不可能在多边形 P 内部。故搜索应该在边界上进行。事实上，由于直径是由多边形的平行切线的最远距离决定的，所以我们只需要查询对踵点。 Shamos (1978) 提供了一个 O(n) 时间复杂度计算n点凸包对踵点对的算法。直径通过遍历顶点列表，得到最大距离即可。如下是1985年发表于 Preparata 和 Shamos 文章中的 Shamos 算法的伪代码。
输入是一个多边形 P ={ p1 ,..., pn }.

begin
     p0:=pn;
     q:=NEXT[p];
     while (Area(p,NEXT[p],NEXT[q]) > Area(p,NEXT[p],q)) do
          q:=NEXT[q];
          q0:=q;
          while (q != p0) do
               begin
                    p:=NEXT[p];
                    Print(p,q);
                    while (Area(p,NEXT[p],NEXT[q]) > Area(p,NEXT[p],q) do
                         begin
                              q:=NEXT[q];
                              if ((p,q) != (q0,p0)) then Print(p,q)
                              else return
                         end;
                    if (Area(p,NEXT[p],NEXT[q]) = Area(p,NEXT[p],q)) then
                      if ((p,q) != (q0,p0)) then Print(p,NEXT[q])
                      else Print(NEXT[p],q)
               end
end.