上一页 1 ··· 5 6 7 8 9 10 11 12 下一页
  2012年7月31日
摘要: Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enough, it shall be able to reach the banana by placing one block on 阅读全文
posted @ 2012-07-31 18:56 crying_Dream 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.Given a consecutive number sequence S1, S2, S3, S4 ... Sx, ... Sn (1 ≤ x ≤ 阅读全文
posted @ 2012-07-31 18:53 crying_Dream 阅读(226) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order.For example, consider forming "tcraete" from &q 阅读全文
posted @ 2012-07-31 18:51 crying_Dream 阅读(156) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmouse has hid between 0 and 100 blocks of cheese in a hole. Now he' 阅读全文
posted @ 2012-07-31 18:48 crying_Dream 阅读(183) 评论(0) 推荐(0) 编辑
摘要: DescriptionAfter Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 <= N <= 10,000) barns at an incredible cost, he sued Bessie to mitigate his losses. Bessie, feeling vindictive, decided to sabotage Farmer John's network by cutting power to one 阅读全文
posted @ 2012-07-31 18:44 crying_Dream 阅读(237) 评论(0) 推荐(0) 编辑
摘要: DescriptionLast years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.Unfortunately, the structure of Chicago mafia is rather complicated. There are n persons known to be related to mafia. 阅读全文
posted @ 2012-07-31 18:41 crying_Dream 阅读(393) 评论(0) 推荐(0) 编辑
摘要: DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the largest tree in the forest T created by deleting that node from T. For example, co 阅读全文
posted @ 2012-07-31 18:39 crying_Dream 阅读(164) 评论(0) 推荐(0) 编辑
摘要: DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldiers on t 阅读全文
posted @ 2012-07-31 18:33 crying_Dream 阅读(180) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tree rooted at the rector V. E. Tretyakov. In order to make the party funny for eve 阅读全文
posted @ 2012-07-31 18:31 crying_Dream 阅读(158) 评论(0) 推荐(0) 编辑
摘要: DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest s 阅读全文
posted @ 2012-07-31 18:28 crying_Dream 阅读(144) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 下一页