12特殊的数 基础ACM课件.pptVIP

ACM程序设计;每周一星（11）：;第十二讲;Fibonacci Number;Key Words: 1225; Pisa; Fibonacci Frederick II; Math Competition.;January;February;March;April;May、June…;The number series is——;Date;Date;Date;Date;Fibonacci Golden Section;Fibonacci plants;Fibonacci plants;Fibonacci plants;Fibonacci plants;sunflowers （向日葵）;Date;Date;Date;Question:;Catalan number;HDOJ_1134: Game of Connections ; Catalan numbers (1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, ...);Catalan数有哪些应用?;1. 多边形的三角剖分数目 ;5 sides, 5 ways;6 sides, 14 ways;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 ;5 nodes: ;4. the number of paths of length 2n through an n-by-n grid that do not rise above the main diagonal ;3 x 3 grid: ;5. 不同形态二叉树的数目 ;6. 其它应用;(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.;HDOJ_1133 Buy the Ticket ;算法分析：;(3)其他情况： 考虑（m+n）个人排队购票的情景，第（m+n）人站在第（m+n-1）个人的后面，则第（m+n ）个人的排队方式可以由下列两种情况获得： a.第（m+n ）个人手持￥100的钞票，则在他之前的(m+（n-1））个人中有m个人手持￥50的钞票，有（n-1）个人手持￥100的钞票，此种情况共有f(m,n-1); b.第（m+n ）个人手持￥50的钞票，则在他之前的(（m-1）+n）个人中有m-1个人手持￥50的钞票，有n个人手持￥100的钞票，此种情况共有f(m-1,n);;根据加法原理得到: f(m,n)=f(m-1,n)+f(m,n-1) 于是得到f(m,n)的计算公式;计算示意图：;计算示意图：;计算示意图：;对于一般情况（m=n0）;相关练习;Welcome to HDOJ