poj 1696 Space Ant(模拟+叉积)
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3840 Accepted: 2397DescriptionThe most exciting space discovery occurred at the end...
POJ 1696 Space Ant 极角排序(叉积的应用)
题目大意:给出n个点的编号和坐标,按逆时针方向连接着n个点,按连接的先后顺序输出每个点的编号。题目思路:Cross(a,b)表示a,b的叉积,若小于0:a在b的逆时针方向,若大于0a在b的顺时针方向。每次都sort一下,找出在当前点逆时针方向的最远的点。数据很小O(N*N*log(N))的复杂度0s...
poj 2318 TOYS (二分+叉积)
http://poj.org/problem?id=2318TOYSTimeLimit: 2000MS MemoryLimit: 65536KTotalSubmissions: 10178 Accepted: 4880DescriptionCalculatethenumberoftoysthatla...
POJ 2398 Toy Storage(计算几何,叉积判断点和线段的关系)
ToyStorageTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:3146 Accepted:1798DescriptionMomanddadhaveaproblem:theirchild,Reza,neverputshistoysawayw...
(POJ 2318)TOYS 向量叉积
题目链接:http://poj.org/problem?id=2318#include<stdio.h>#include<cstdlib>#include<cstring>#include<algorithm>#include<queue>...