poj 1066 Treasure Hunt
摘要:枚举边上相邻点的中点,和终点连线,计算其和其他线段的交点。值得回味的地方是kuailezhish帮我想出的排序的方案。#include#include#include#include#include#include#include#include#include#define mem(a,b) memset(a,b,sizeof(a))#define MAX(a,b) ((a)>(b)?(a):(b))#define MIN(a,b) ((a)<(b)?(a):(b))#define INF 0x3f3f3f3fusing namespace std;struct point {
阅读全文
posted @ 2013-07-21 21:27
浙公网安备 33010602011771号