USACO: Section 1.4 -- PROB Arithmetic Progressions
摘要：
Source Code Lesson Learned: 1. Just as the sorting, searching algorithms, the sequence search(O(N)) < binary search(O(logN)) < bitmap algorithm(O(1)). 2. To boost performance a program, the most po... 阅读全文
posted @ 2008-07-03 13:44 比尔盖房 阅读(415) 评论(0) 推荐(0) 编辑