- 博客(20)
- 收藏
- 关注
RSS订阅原创 某个点到其他点的曼哈顿距离之和最小（HDU4311）
Meeting point-1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2866 Accepted Submission(s): 919Problem DescriptionIt has been
2014-10-31 20:36:43
5879
原创 第k最短路A*启发式搜索
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 21549 Accepted: 5862Description"Good man never makes girls wait or breaks an appointment
2014-10-21 19:04:22
748
原创 求树的直径和中心（ZOJ3820）
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5374
2014-10-21 14:41:33
616
原创 并查集hdu4424
Conquer a New RegionTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1271 Accepted Submission(s): 415Problem DescriptionThe wh
2014-10-21 11:07:31
852
原创 map容器结构体离散化
#include"string.h"#include"stdio.h"#include"iostream"#include"algorithm"#include"queue"#include"stack"#include"stdlib.h"#include"map"#include"string"#include"math.h"#define inf 10000000#def
2014-10-21 09:29:47
2125
原创 二维坐标系极角排序的应用（POJ1696）
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3170 Accepted: 2029DescriptionThe most exciting space discovery occurred at the end of the 20th
2014-10-17 09:42:30
752
原创 几何+线段交点+spfa（POJ1066）
Treasure HuntTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 2Problem DescriptionArcheologists from t
2014-10-16 15:31:04
556
原创 判断是否存在一条直线穿过所有的线段
SegmentsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 11 Accepted Submission(s) : 1Problem DescriptionGiven n segments in t
2014-10-15 12:29:17
964
原创 几何+点与线段的位置关系+二分（POJ2318）
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10666 Accepted: 5128DescriptionCalculate the number of toys that land in each bin of a partitioned t
2014-10-14 18:24:57
844
原创 二维凸包模板（凸包重心，周长，面积，直径，最大三角形，最小环绕矩形）
#include"string.h"#include"stdio.h"#include"iostream"#include"algorithm"#include"queue"#include"stack"#define M 100009#define N 100009#include"stdlib.h"#include"math.h"#define inf 1000000000
2014-10-14 14:05:26
1380
原创 点双联通+缩点+LCA（HDU3686）
Traffic Real Time Query SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1929 Accepted Submission(s): 380Problem Descripti
2014-10-11 12:32:42
809
原创 三维凸包（两个没有公共点）经过旋转平移后使其重心相距最近（POJ3862）
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 481 Accepted: 152 Special JudgeDescriptionAssociation of Collision Management (ACM) is plan
2014-10-10 16:05:55
569
原创 三维凸包求其表面积（POJ3528）
Ultimate WeaponTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 2074 Accepted: 989DescriptionIn year 2008 of the Cosmic Calendar, the Aliens send a huge
2014-10-10 15:59:36
589
原创 三维凸包求凸包表面的个数（HDU3662）
3D Convex HullTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1266 Accepted Submission(s): 658Problem DescriptionThere are N
2014-10-10 15:59:27
582
原创 三维凸包求内部一点到表面的最近距离（HDU4266）
http://acm.hdu.edu.cn/showproblem.php?pid=4266
2014-10-10 15:45:19
672
原创 三维凸包模板
分析：给出三维空间中的n个顶点,求解由这n个顶点构成的凸包表面的多边形个数.增量法求解:首先任选4个点形成的一个四面体,然后每次新加一个点,分两种情况: 1> 在凸包内,则可以跳过 2> 在凸包外,找到从这个点可以"看见"的面S(看不看得见可以用法向量，看点是否在面外侧),删除这些面S,然后对于S的每条边E进行判断，看该点还能否看到这些边E的另一
2014-10-10 15:31:03
547
原创 判断点与多边形的位置关系
Cupid's ArrowTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1033 Accepted Submission(s): 382Problem Description传说世上有一支丘比特的箭，凡是被这
2014-10-05 18:07:30
1263
原创 树链剖分+离散+扫描（HDU5044）
TreeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1385 Accepted Submission(s): 237Problem DescriptionYou are given a tree
2014-10-01 16:16:44
540
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人