lecture7特殊的数.ppt

ACM程序设计 杭州电子科技大学 刘春英 acm@hdu.edu.cn 每周一星（6）： 第七讲 特殊的数（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? Key Words: 1225; Pisa; Fibonacci & Frederick II; Math Competition. 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: 编程实现这类递归问题时应该注意什么问题？ 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, ...) 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）当m<n时 显然，f(m,n)=0 (3)其他情况： 考虑（m+n）个人排队购票的情景，第（m+n）人站在第（m+n-1）个人的后面，则第（m+n ）个人的排队方式可以由下列两种情况获得： a.第（m+n ）个人手持￥100的钞票，则在他之前的(m+（n-1））个人中有m个人手持￥50的钞票，有（n-1）个人手持￥100的钞票，此种情况共有f(m,