USACO: Section 1.5 -- PROB Number Triangles
摘要：
Source Code This problem requires us to search all the possible paths. For every level i, the i+1 level has searching choices: f(i+1)=2*f(i). So, for R rows, the final level paths are O(2^R). This c... 阅读全文
posted @ 2008-07-06 10:54 比尔盖房 阅读(298) 评论(0) 推荐(0) 编辑