摘要： Number GuessingTime Limit 1000msMemory Limit 65536KdescriptionNumber Guessing is a computer game. First, the computer chooses four different digits, you need to guess these four digits in the fewest times，for each guess, the computer will show a judgement in the form of "#A#B", "#&quo 阅读全文

摘要： AnagramTime Limit 4000msMemory Limit 65536KdescriptionYou are to write a program that has to generate all possible words from a given set of letters. Example: Given the word "abc", your program should - by exploring all different combination of the three letters - output the words "ab 阅读全文

摘要： Substrings expTime Limit 1000msMemory Limit 65536KdescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings. inputThe first line of the input co... 阅读全文

摘要： Garbage HeapTime limit: ? secondsMemory limit: 64 megabytesFarmer John has a heap of garbage formed in a rectangular parallelepiped.It consists ofgarbage pieces each of which has a value. The value of a piece may be 0, if the piece is neither profitable nor harmful, and may be negative which means t 阅读全文

摘要： Paleontologists in Siberia have recently found a number of fragments of Jurassic period dinosaur skeleton. The paleontologists have decided to forward them to the paleontology museum. Unfortunately, the dinosaur was so huge, that there was no box that the fragments would fit into. Therefore it was d 阅读全文

摘要： Bob 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 the nodes so 阅读全文

摘要： 算法设计基础①思维的体操②问题求解常见策略General Problem Solving Techniques③高效算法设计举例Designing Efficient Algorithms④动态规划专题⑤小结与习题暴力NEFU 722 Anagram 全排列 STL枚举UVa 10755 - Garbage Heap 最大子块和 dpNEFU 721 Substrings exp 枚举NEFU 725 Number Guessing 枚举贪心二分回溯线性扫描扫描线法求最大子矩阵递推中途相遇Uva 1326 - Jurassic Remains 中途相遇法哈希哈希模板UVa 10391 - Co 阅读全文

摘要： 算法设计基础①思维的体操②问题求解常见策略General Problem Solving Techniques③高效算法设计举例Designing Efficient Algorithms④动态规划专题⑤小结与习题暴力NEFU 722 Anagram 全排列 STL枚举UVa 10755 - Garbage Heap 最大子块和 dpNEFU 721 Substrings exp 枚举NEFU 725 Number Guessing 枚举贪心二分回溯线性扫描扫描线法求最大子矩阵递推中途相遇Uva 1326 - Jurassic Remains 中途相遇法哈希哈希模板UVa 10391 - Co 阅读全文

摘要： Power transmissionTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1403Accepted Submission(s): 533Problem DescriptionThe project West-East power transmission is famous around the world. It transmits the electricity from western areas to east Chin 阅读全文

摘要： The NASA Space Center, Houston, is less than 200 miles from San Antonio, Texas (the site of the ACM Finals this year). This is the place where the astronauts are trained for Mission Seven Dwarfs, the next giant leap in space exploration. The Mars Odyssey program revealed that the surface of Mars is 阅读全文