摘要：
第一章：Recurrent Problems三个例题：THE TOWER OF HANOI、1.2 LINES IN THE PLANE、THE JOSEPHUS PROBLEM很有意思，讲的很好！三个都是递推问题，我学了以后，感触很深，现在就讲讲本蒟蒻的心得吧~汉诺塔问题：一个递推，原本的很简单，关键是例题的变种！LINES IN THE PLANE给你n条直线，问这n条直线最多可将平面划分为多少个区域？书上告诉我们，我们应该先从小数据开始。L0=1这是显然的，L1=2,L2=4，这些都能很快地得出。于是我们开始想，我们应该怎么样切第n刀，能将形成的用n-1刀切成的平面增加的更多？经过简单的 阅读全文
posted @ 2013-02-15 22:54
cssystem
阅读(520)
评论(0)
推荐(0)
摘要：
Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 135 Accepted Submission(s): 61 Problem Description A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You are ... 阅读全文
posted @ 2013-02-15 11:42
cssystem
阅读(230)
评论(0)
推荐(0)
摘要：
Segment setTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120 Accepted Submission(s): 54 Problem Description A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of... 阅读全文
posted @ 2013-02-15 10:59
cssystem
阅读(265)
评论(0)
推荐(0)
摘要：
How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 283 Accepted Submission(s): 134 Problem Description TT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing ... 阅读全文
posted @ 2013-02-15 10:03
cssystem
阅读(183)
评论(0)
推荐(0)
摘要：
Zjnu StadiumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 152 Accepted Submission(s): 65 Problem Description In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a mod... 阅读全文
posted @ 2013-02-15 09:59
cssystem
阅读(151)
评论(0)
推荐(0)
