POJ 1696 Space Ant 点积计算夹角

【POJ 1696 Space Ant 点积计算夹角】的更多相关文章

POJ 1696 Space Ant 点积计算夹角

题意: 一只特别的蚂蚁,只能直走或者左转.在一个平面上,有很多株植物,这只蚂蚁每天需要进食一株,这只蚂蚁从起点为(0,miny)的点开始出发.求最多能活多少天分析: 肯定是可以吃到所有植物的,以当前方向无限延长成直线,可以剩余的植物都在直线的左边.所以就是求上一个位置到当前位置与下一个位置与当前位置的夹角,并且使夹角最大. cos(0~pi)是单调递减的,夹角越大,cos值越小.所以我用点积来计算. #include <iostream> #include <cstdio> #i…

poj 1696 Space Ant （极角排序）

链接:http://poj.org/problem?id=1696 Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3077 Accepted: 1965 Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an a…

POJ 1696 Space Ant（点积的应用）

Space Ant 大意:有一仅仅蚂蚁,每次都仅仅向当前方向的左边走,问蚂蚁走遍全部的点的顺序输出.開始的点是纵坐标最小的那个点,開始的方向是開始点的x轴正方向. 思路:从開始点開始,每次找剩下的点中与当前方向所形成的夹角最小的点,为下一个要走的点(好像就是犄角排序,我不是非常会),夹角就是用点积除以两个向量的距离,求一下acos值. 之前一直用叉积做,做了好久例子都没过,发现用错了... 题目挺好的,有助于理解点积与叉积 struct Point{ double x, y; int id; }…

POJ 1696 Space Ant（极角排序）

Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2489 Accepted: 1567 Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y19…

poj 1696 Space Ant（模拟+叉积）

Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3840 Accepted: 2397 Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y19…

POJ 1696 Space Ant 卷包裹法

Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3316 Accepted: 2118 Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y19…

2018.07.04 POJ 1696 Space Ant（凸包卷包裹）

Space Ant Time Limit: 1000MS Memory Limit: 10000K Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye o…