2015年8月16日
HDU 3634 City Planning (离散化)
摘要： City PlanningTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 483Accepted Submission(s): 203Problem... 阅读全文
posted @ 2015-08-16 15:13 JoneZP 阅读(246) 评论(0) 推荐(0) 编辑
HDU4762（JAVA大数)
摘要： Cut the CakeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1102Accepted Submission(s): 540Problem... 阅读全文
posted @ 2015-08-16 14:54 JoneZP 阅读(194) 评论(0) 推荐(0) 编辑
POJ3026（BFS + prim)
摘要： Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:10554Accepted:3501DescriptionThe Borg is an immensely powerful race of enhanced humanoi... 阅读全文
posted @ 2015-08-16 14:44 JoneZP 阅读(219) 评论(0) 推荐(0) 编辑
POJ1679(次小生成树）
摘要： The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:24201Accepted:8596DescriptionGiven a connected undirected graph, tell if its minim... 阅读全文
posted @ 2015-08-16 14:32 JoneZP 阅读(156) 评论(0) 推荐(0) 编辑
UVA10487(二分）
摘要： Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of two distinct numbers from the set, whic... 阅读全文
posted @ 2015-08-16 14:18 JoneZP 阅读(125) 评论(0) 推荐(0) 编辑