Algorithm Design Practice for Collegiate Programming Contests and EducationCRC Press, 15/11/2018 - 706 من الصفحات This book can be used as an experiment and reference book for algorithm design courses, as well as a training manual for programming contests. It contains 247 problems selected from ACM-ICPC programming contests and other programming contests. There's detailed analysis for each problem. All problems, and test datum for most of problems will be provided online. The content will follow usual algorithms syllabus, and problem-solving strategies will be introduced in analyses and solutions to problem cases. For students in computer-related majors, contestants and programmers, this book can polish their programming and problem-solving skills with familarity of algorithms and mathematics. |
المحتوى
1 | |
2 Practice for Simulation Problems | 45 |
3 Practice for Number Theory | 99 |
4 Practice for Combinatorics | 153 |
5 Practice for Greedy Algorithms | 215 |
6 Practice for Dynamic Programming | 259 |
7 Practice for Advanced Data Structures | 335 |
8 Practice for Computational Geometry | 443 |
9 Practice for State Space Search | 591 |
References | 677 |
679 | |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
adjacent algorithm block calculate character color connected consists const construct Contest convex coordinates corresponding cost cross determine digit direction distance double edge element empty enumerated example Figure final follows four given graph height i-th IDs for Online initial Input Sample Output Input The input integer intersection interval length light line containing longest maximum method minimal move node Online Judge operator pair path permutation placed player polygon position possible prime problem queue rectangle represented root Sample Input Sample segment segment tree separated sequence shown sides single solution solve sorted Source space square starting step stored string subinterval Suppose tree vertex vertices void wall write