7.1.8 Assignments
摘要：AssignmentsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48 Accepted Submission(s): 35 Problem Description In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A need...
阅读全文
posted @
2013-07-13 22:15
cssystem
阅读(170)
推荐(0)
7.1.7 Quoit Design
摘要：Problem Description Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a ti
阅读全文
posted @
2013-07-13 22:13
cssystem
阅读(198)
推荐(0)
7.1.6 Maple trees
摘要：Problem Description There are a lot of trees in HDU. Kiki want to surround all the trees with the minimal required length of the rope . As follow, To make this problem more simple, consider all the trees are circles in a plate. The diameter of all the trees are the same (the diamet...
阅读全文
posted @
2013-07-13 16:12
cssystem
阅读(442)
推荐(0)
7.1.4 Surround the Trees
摘要：---恢复内容开始---Surround the TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 166 Accepted Submission(s): 81 Problem Description There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at...
阅读全文
posted @
2013-07-12 00:14
cssystem
阅读(256)
推荐(0)
