2012年10月6日
hdu3629 计算几何
摘要： ConvexTime Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1386 Accepted Submission(s): 421 Problem DescriptionYour task is very simple. You will get the coordinates of n points in a plane. It is guaranteed that there are no three points on a straigh 阅读全文
posted @ 2012-10-06 21:18 _sunshine 阅读(768) 评论(0) 推荐(0)