This is the third edition of Competitive Programming book.
This is the A5 paperback version. This is the intended version for typical audience, i.e. young programmers of age 15-25. If you need a larger 8.25 * 10.75 inch version (about the size of A4, or 2 x A5), please go to: http://www.lulu.com/shop/steven-halim/competitive-programming-3-hardcover/hardcover/product-21031840.ht...
This is the third edition of Competitive Programming book.
This is the A5 paperback version. This is the intended version for typical audience, i.e. young programmers of age 15-25. If you need a larger 8.25 * 10.75 inch version (about the size of A4, or 2 x A5), please go to: http://www.lulu.com/shop/steven-halim/competitive-programming-3-hardcover/hardcover/product-21031840.html
A much more detailed information about this book is available at: https://cpbook.net
作者简介
· · · · · ·
I am a senior lecturer in Department of Computer Science, SoC, NUS where I teach a diverse range (so far 5 big categories) of programming or algorithm modules, i.e.:
'Basic' Data Structures and Algorithm Courses: CS2040 and CS2040C (and its older variants: CS1020E, CS2010, CS2020),
My 'Special' Competitive Programming Course: CS3233,
I am a senior lecturer in Department of Computer Science, SoC, NUS where I teach a diverse range (so far 5 big categories) of programming or algorithm modules, i.e.:
'Basic' Data Structures and Algorithm Courses: CS2040 and CS2040C (and its older variants: CS1020E, CS2010, CS2020),
My 'Special' Competitive Programming Course: CS3233,
Advanced Algorithm Courses: CS3230 — currently inactive, CS4234.
Basic Programming Methodology Courses: IT1005 (equivalent module: IT1006 and CG1101), CS1281, CS2281 — all currently inactive,
Web Programming Course: CS3226 (previously CP3101B) — currently inactive,
原文摘录
· · · · · ·
Moreover, C++ STL maps or sets (and Java TreeMaps or TreeSets) are usually fast enough as the typical input size of (programming contest) problems is usually not more than 1M. Within these bounds, the O(1) performance of Hash Tables and O(log1M) performance for balanced BSTs do not differ by much. Thus, we do not discuss Hash Tables in detail in this section. (查看原文)
a_酋长
还没人写过短评呢