（lecture_05）特殊的数 ACM课件.pptVIP

第十讲 特殊的数（Special Number） Fibonacci Number The series begins with 0 and 1. After that, use the simple rule: Add the last two numbers to get the next. 0 , 1 , 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,... Where this came from? 古代谜题：如果一对兔子每月能生一对小兔，而每对小兔在它出生后的第三个月又能生一对小兔，假定在兔子不死亡的情况下，由一对小兔开始，50个月后会有多少对兔子. January February March April May、June… ??? The number series is—— 1、1、2、3、5… Fibonacci Golden Section Fibonacci plants Fibonacci plants Fibonacci plants Fibonacci plants sunflowers （向日葵） Question: 编程实现这类递归问题时应该注意什么问题？ 相关例题 1.楼梯有n阶台阶,上楼可以一步上1阶,也可以一步上2阶,编一程序计算共有多少种不同的走法? ????? 2.有一对雌雄兔,每两个月就繁殖雌雄各一对兔子.问n个月后共有多少对兔子? ????? 3.有n*2的一个长方形方格,用一个1*2的骨牌铺满方格。求铺法总数？ Catalan number HDOJ_1134: Game of Connections Catalan Number Catalan numbers (1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, ...) f(n) = f(n-1) + f(n-2)f(1) + f(n-3)f(2) +......+ f(n-1) Catalan数有哪些应用? 1. 多边形的三角剖分数目 7 sides, 42 ways: 2. 加括号的方式数目 (1 (2 (3 (4 5)))) (1 (2 ((3 4) 5))) (1 ((2 3) (4 5))) (1 ((2 (3 4)) 5)) (1 (((2 3) 4) 5)) ((1 2) (3 (4 5))) ((1 2) ((3 4) 5)) ((1 (2 3)) (4 5)) ((1 (2 (3 4))) 5) ((1 ((2 3) 4)) 5) (((1 2) 3) (4 5)) (((1 2) (3 4)) 5) (((1 (2 3)) 4) 5) ((((1 2) 3) 4) 5) 3.the number of rooted, trivalent trees with n+1 nodes 4. the number of paths of length 2n through an n-by-n grid that do not rise above the main diagonal 5. 不同形态二叉树的数目 6. 其它应用 （1）The number of ways 2n people, seated round a table, can shake hands in n pairs, without their arms crossing. （2）The self-convolving sequence, c[0]=1, c[n+1] = c[0]c[n] + c[1]c[n-1] + ... + c[n]c[0] (3) The recurring sequence c[0]=1, (n+2)c[n+1] = (4n+2)c[n], (n=0). (4)Another disguise is the number of ways n votes can come in for each of two candidates A and B in an election, with A never behind B. 算法分析： 首先假设人无区别 令f(m,n)表示有m个人手持￥50的钞票，n个人手持￥100的钞票时共有的方案总数。则可以分以下情况讨论这个问题： （1）当n=0时 N=0意味着排队购票的所有人手中拿的都是 ￥50的钞票，那么这m个人排队方案总数为1。 （2）当mn时 显然，f(m,n)=0 (3)其他情况：