摘要: 卡特兰数,打表水过了。PillsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 682 Accepted Submission(s): 446Problem DescriptionAunt Lizzie takes half a pi... 阅读全文
posted @ 2013-05-13 06:28 码代码的猿猿 阅读(168) 评论(0) 推荐(0) 编辑
摘要: 首先是划分为n-2,和2两部分,有3种。划分为n-4和4两部分,不重复的划分有2种。划分为n-6和6两部分,不重复的划分还是有2种。。。所以递推公式为 F(n)=3*F(n-2)+2×F(n-4)+2*F(n-6)+。。。+2*F(0);化简: F(n)=3*F(n-2)+2×F(n-4)+2*F(n-6)+。。。+2*F(0)与F(n-2)=3*F(n-4)+2×F(n-6)+2*F(n-8)... 阅读全文
posted @ 2013-05-13 00:52 码代码的猿猿 阅读(161) 评论(0) 推荐(0) 编辑