{"product_id":"138146","title":"A set of algorithmic problem-solving strategies ","description":"\u003ccenter\u003e\u003cdiv style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/tmgdisk01.cafe24.com\/images\/vs\/4172\/sv\/3jXPCfJhzrkBlKqZCV4Wz2xQOYUCJv.png?v=1765060709\" style=\"max-width:100%;max-height:10px\"\u003e\u003c\/div\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\n\n\u003cdiv style=\"width:95%\"\u003e\n\n\u003cdiv style=\"text-align:center;font-size:30px;font-weight:bolder;line-height:1.6em\"\u003e A set of algorithmic problem-solving strategies \u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"border-bottom:1px;border-bottom-style:dotted;border-color:;padding-bottom:20px\"\u003e\u003ccenter\u003e\u003ctable align=\"center\" width=\"100%\"\u003e\u003ctbody style=\"border:0px\"\u003e\n\n\u003ctr\u003e\u003ctd align=\"center\" style=\"line-height:1.2em;text-align:center;font-size:18px;color:black;font-weight:bold;padding-bottom:20px;\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\u003ctr\u003e\u003ctd style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/image.yes24.com\/goods\/8006522\/XL\" style=\"max-width:100%;height:auto\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\n\u003c\/tbody\u003e\u003c\/table\u003e\u003c\/center\u003e\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;{split_style6}padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e Description \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;word-break:break-all;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eBook Introduction\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e  \u003cdiv\u003eThis book is designed to help you learn about various algorithm design techniques and data structures while solving programming competition problems, and further develop your problem-solving skills.\u003cbr\u003e Each chapter includes practice problems that readers can write and grade on their own, and each practice problem is accompanied by sample answers and detailed explanations of the process of designing the answer.\u003cbr\u003e\n\n\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cdiv\u003e\u003cul\u003e\u003cli\u003e You can preview some of the book's contents.\u003cbr\u003e \u003cspan\u003ePreview\u003c\/span\u003e\n\n\u003c\/li\u003e\u003c\/ul\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eindex\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e \u003cb\u003e==== Volume 1 ====\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Author's Note\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePart 1: Getting Started with Troubleshooting\u003c\/b\u003e\u003cbr\u003e __survey\u003cbr\u003e\u003cbr\u003e Chapter 1: Problem Solving and Programming Contests\u003cbr\u003e __1.1 Introduction\u003cbr\u003e __1.2 Programming Contest\u003cbr\u003e __1.3 How to read this book\u003cbr\u003e __1.4 Programming competitions you can participate in domestically\u003cbr\u003e __1.5 Advice for preparing for the competition\u003cbr\u003e __1.6 Further Reading\u003cbr\u003e\u003cbr\u003e Chapter 2: Problem Solving Overview\u003cbr\u003e __2.1 Introduction\u003cbr\u003e __2.2 Problem Solving Process\u003cbr\u003e __2.3 Problem Solving Strategies\u003cbr\u003e __2.4 Further Reading\u003cbr\u003e \u003cbr\u003eChapter 3: Coding and Debugging\u003cbr\u003e __3.1 Introduction: Don't Overlook the Importance of Coding\u003cbr\u003e __3.2 Principles for writing good code\u003cbr\u003e __3.3 Common Mistakes\u003cbr\u003e __3.4 Debugging and Testing\u003cbr\u003e __3.5 Understanding Variable Scope\u003cbr\u003e __3.6 Understanding real data types (optional)\u003cbr\u003e __3.7 Further Reading\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePart 2 Algorithm Analysis\u003c\/b\u003e\u003cbr\u003e survey\u003cbr\u003e\u003cbr\u003e Chapter 4: Time Complexity Analysis of Algorithms\u003cbr\u003e __4.1 Introduction\u003cbr\u003e __4.2 Linear-time algorithms\u003cbr\u003e __4.3 Sublinear Time Algorithms\u003cbr\u003e __4.4 Exponential Time Algorithm\u003cbr\u003e __4.5 time complexity\u003cbr\u003e __4.6 Estimating execution time\u003cbr\u003e __4.7 Computational complexity classes: P, NP, NP-complete\u003cbr\u003e __4.8 Further Reading\u003cbr\u003e\u003cbr\u003e Chapter 5 Proof of the Algorithm's Validity\u003cbr\u003e __5.1 Introduction\u003cbr\u003e __5.2 Mathematical induction and loop invariants\u003cbr\u003e __5.3 The law of reductio ad absurdum\u003cbr\u003e __5.4 Other technologies\u003cbr\u003e __5.5 Further Reading\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePart 3: Algorithm Design Paradigms\u003c\/b\u003e\u003cbr\u003e __survey\u003cbr\u003e\u003cbr\u003e Chapter 6: Solving Idiotically\u003cbr\u003e __6.1 Introduction\u003cbr\u003e __6.2 Recursive calls and exhaustive search\u003cbr\u003e __6.3 Problem: Picnic (Difficulty: Easy, Problem ID: PICNIC)\u003cbr\u003e __6.4 Solution: Picnic  \u003cbr\u003e__6.5 Problem: Cover the Board (Difficulty: Easy, Problem ID: BOARDCOVER)\u003cbr\u003e __6.6 Solution: Cover the game board\u003cbr\u003e __6.7 Optimization Problem\u003cbr\u003e __6.8 Problem: Clock Synchronization (Difficulty: Medium, Problem ID: CLOCKSYNC)\u003cbr\u003e __6.9 Solution: Setting the Clock\u003cbr\u003e __6.10 Frequently appearing complete search types\u003cbr\u003e\u003cbr\u003e Chapter 7 Divide and Conquer\u003cbr\u003e __7.1 Introduction\u003cbr\u003e __7.2 Problem: Flipping a Quad Tree (Problem ID: QUADTREE, Difficulty: Easy)\u003cbr\u003e __7.3 Solution: Flipping a Quad Tree\u003cbr\u003e __7.4 Problem: Cutting the Fence (Problem ID: FENCE, Difficulty: Medium)\u003cbr\u003e __7.5 Solution: Cutting the Fence\u003cbr\u003e __7.6 Problem: Fan Meeting (Problem ID: FANMEETING, Difficulty: High)\u003cbr\u003e __7.7 Solution: Fan Meeting\u003cbr\u003e\u003cbr\u003e Chapter 8 Dynamic Programming\u003cbr\u003e __8.1 Introduction\u003cbr\u003e __8.2 Problem: Wildcard (Problem ID: WILDCARD, Difficulty: Medium)\u003cbr\u003e __8.3 Solution: Wildcard\u003cbr\u003e __8.4 Traditional Optimization Problems\u003cbr\u003e __8.5 Problem: Combined LIS (Problem ID: JLIS, Difficulty: Easy)\u003cbr\u003e __8.6 Solution: Combined LIS\u003cbr\u003e __8.7 Problem: Memorizing Pi (Problem ID: PI, Difficulty: Easy)\u003cbr\u003e __8.8 Solution: Memorizing Pi  \u003cbr\u003e__8.9 Problem: Quantization (Problem ID: QUANTIZE, Difficulty: Medium)\u003cbr\u003e __8.10 Solution: Quantization\u003cbr\u003e __8.11 Number of cases and probability\u003cbr\u003e __8.12 Problem: Asymmetric Tiling (Problem ID: ASYMTILING, Difficulty: Easy)\u003cbr\u003e __8.13 Solution: Asymmetric tiling\u003cbr\u003e __8.14 Problem: Polyominoes (Problem ID: POLY, Difficulty: Medium)\u003cbr\u003e __8.15 Solution: Polyomino\u003cbr\u003e __8.16 Problem: Dr. Dunibal's Jailbreak (Problem ID: NUMB3RS, Difficulty: Medium)\u003cbr\u003e __8.17 Solution: Dr. Dunibal's Escape\u003cbr\u003e\u003cbr\u003e Chapter 9 Dynamic Programming Techniques\u003cbr\u003e __9.1 Calculating the Actual Solution to an Optimization Problem\u003cbr\u003e __9.2 Problem: Packing for a Trip (Problem ID: PACKING, Difficulty: Medium)\u003cbr\u003e __9.3 Solution: Packing for a Trip\u003cbr\u003e __9.4 Problem: Optical Character Recognition (Problem ID: OCR, Difficulty: High)\u003cbr\u003e __9.5 Solution: Optical Character Recognition\u003cbr\u003e __9.6 Calculating the kth answer\u003cbr\u003e __9.7 Problem: The kth maximally increasing subsequence (Problem ID: KLIS, Difficulty: High)\u003cbr\u003e __9.8 Solution: kth maximally increasing subsequence\u003cbr\u003e __9.9 Problem: Dragon Curve (Problem ID: DRAGON, Difficulty: Medium)\u003cbr\u003e __9.10 Solution: Dragon Curve  \u003cbr\u003e__9.11 Memoization for non-integer inputs\u003cbr\u003e __9.12 Problem: Webbazym (Problem ID: ZIMBABWE, Difficulty: High)\u003cbr\u003e __9.13 Solution: Webbajim\u003cbr\u003e __9.14 Problem: Restoring Experimental Data (Problem ID: RESTORE, Difficulty: Medium)\u003cbr\u003e __9.15 Solution: Recovering Experimental Data\u003cbr\u003e __9.16 Combination Game\u003cbr\u003e __9.17 Problem: Number Game (Problem ID: NUMBERGAME, Difficulty: Easy)\u003cbr\u003e __9.18 Solution: Number Game\u003cbr\u003e __9.19 Problem: Block Game (Problem ID: BLOCKGAME, Difficulty: Medium)\u003cbr\u003e __9.20 Solution: Block Game\u003cbr\u003e __9.21 Iterative dynamic programming\u003cbr\u003e __9.22 Problem: Conveyor Belt Sushi (Problem ID: SUSHI, Difficulty: Medium)\u003cbr\u003e __9.23 Solution: Conveyor Belt Sushi\u003cbr\u003e __9.24 Problem: Genius (Problem ID: GENIUS, Difficulty: Medium)\u003cbr\u003e __9.25 Solution: Genius\u003cbr\u003e __9.26 Further Reading\u003cbr\u003e\u003cbr\u003e Chapter 10: The Law of Greed\u003cbr\u003e __10.1 Introduction\u003cbr\u003e __10.2 Problem: Warming a Lunchbox (Problem ID: LUNCHBOX, Difficulty: Easy)\u003cbr\u003e __10.3 Solution: Warming up a lunchbox\u003cbr\u003e __10.4 Problem: Joining Strings (Problem ID: STRJOIN, Difficulty: Medium)\u003cbr\u003e __10.5 Solution: Concatenating Strings  \u003cbr\u003e__10.6 Problem: Minas Anor (Problem ID: MINASTIRITH, Difficulty: High)\u003cbr\u003e __10.7 Solution: Minas Anor\u003cbr\u003e\u003cbr\u003e Chapter 11 Combinatorial Exploration\u003cbr\u003e __11.1 Introduction\u003cbr\u003e __11.2 Combinatorial search techniques\u003cbr\u003e __11.3 Problem: Board Cover 2 (Problem ID: BOARDCOVER2, Difficulty: Easy)\u003cbr\u003e __11.4 Solution: Cover the Game Board 2\u003cbr\u003e __11.5 Problem: Friends with Severe Allergies (Problem ID: ALLERGY, Difficulty: Medium)\u003cbr\u003e __11.6 Solution: Friends with severe allergies\u003cbr\u003e __11.7 Problem: Kakuro (Problem ID: KAKURO2, Difficulty: Medium)\u003cbr\u003e __11.8 Solution: Kakuro\u003cbr\u003e __11.9 Further Reading\u003cbr\u003e\u003cbr\u003e Chapter 12: Converting Optimization Problems into Decision Problems\u003cbr\u003e __12.1 Introduction\u003cbr\u003e __12.2 Problem: Antarctic Base (Problem ID: ARCTIC, Difficulty: Easy)\u003cbr\u003e __12.3 Solution: Antarctic Base\u003cbr\u003e __12.4 Problem: Canada Trip (Problem ID: CANADATRIP, Difficulty: Medium)\u003cbr\u003e __12.5 Solution: Traveling to Canada\u003cbr\u003e __12.6 Problem: Withdrawing from a Course (Problem ID: WITHDRAWAL, Difficulty: High)\u003cbr\u003e __12.7 Solution: Withdrawal from class\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePart 4: Famous Algorithms\u003c\/b\u003e\u003cbr\u003e __survey\u003cbr\u003e\u003cbr\u003e Chapter 13 Numerical Analysis\u003cbr\u003e __13.1 Introduction\u003cbr\u003e __13.2 Dichotomy  \u003cbr\u003e__13.3 Problem: Increasing the Winning Rate (Problem ID: RATIO, Difficulty: Easy)\u003cbr\u003e __13.4 Solution: Increasing the odds of winning\u003cbr\u003e __13.5 Tripartite Search\u003cbr\u003e __13.6 Problem: Pollen Fossils (Problem ID: FOSSIL, Difficulty: High)\u003cbr\u003e __13.7 Solution: Pollen Fossil\u003cbr\u003e __13.8 Other topics\u003cbr\u003e\u003cbr\u003e Chapter 14 Number Theory\u003cbr\u003e __14.1 Introduction\u003cbr\u003e __14.2 prime numbers\u003cbr\u003e __14.3 Problem: Password 486 (Problem ID: PASS486, Difficulty: Medium)\u003cbr\u003e __14.4 Solution: Password 486\u003cbr\u003e __14.5 Euclidean algorithm\u003cbr\u003e __14.6 Problem: Magic Potion (Problem ID: POTION, Difficulty: Medium)\u003cbr\u003e __14.7 Solution: Magic Potion\u003cbr\u003e __14.8 Modular Operations\u003cbr\u003e __14.9 Further Reading (optional)\u003cbr\u003e\u003cbr\u003e Chapter 15 Computational Geometry\u003cbr\u003e __15.1 Introduction\u003cbr\u003e __15.2 Tools of Computational Geometry\u003cbr\u003e __15.3 Intersection, distance, and area\u003cbr\u003e __15.4 Problem: Pinball Simulation (Problem ID: PINBALL, Difficulty: High)\u003cbr\u003e __15.5 Solution: Pinball Simulation\u003cbr\u003e __15.6 Polygon\u003cbr\u003e __15.7 Problem: Treasure Island (Problem ID: TREASURE, Difficulty: High)\u003cbr\u003e __15.8 Solution: Treasure Island\u003cbr\u003e __15.9 Problem: Nerd or Not Nerd? (Problem ID: NERDS, Difficulty: Medium)  \u003cbr\u003e__15.10 Solution: Nerd or not?\u003cbr\u003e __15.11 Computational Geometry Algorithm Design Patterns\u003cbr\u003e __15.12 Common Mistakes and Things to Watch Out for\u003cbr\u003e __15.13 Further Reading\u003cbr\u003e\u003cbr\u003e \u003cb\u003e==== Volume 2 ====\u003cbr\u003e\u003cbr\u003e Part 5: Basic Data Structures\u003c\/b\u003e\u003cbr\u003e __survey\u003cbr\u003e\u003cbr\u003e Chapter 16 Bitmask\u003cbr\u003e __16.1 Introduction\u003cbr\u003e __16.2 Implementation of sets using bitmasks\u003cbr\u003e __16.3 Example of Bitmask Application\u003cbr\u003e __16.4 Problem: Graduation Semester (Problem ID: GRADUATION, Difficulty: Medium)\u003cbr\u003e __16.5 Solution: Graduation Semester\u003cbr\u003e __16.6 Further Reading\u003cbr\u003e\u003cbr\u003e Chapter 17 Partial Sum\u003cbr\u003e __17.1 Introduction\u003cbr\u003e __17.2 Problem: Christmas Doll (Problem ID: CHRISTMAS, Difficulty: Medium)\u003cbr\u003e __17.3 Solution: Christmas Doll\u003cbr\u003e __17.4 Further Study\u003cbr\u003e\u003cbr\u003e Chapter 18 Linear Data Structures\u003cbr\u003e __18.1 Introduction\u003cbr\u003e __18.2 Dynamic Arrays\u003cbr\u003e __18.3 Linked List\u003cbr\u003e __18.4 Comparison of dynamic arrays and linked lists\u003cbr\u003e __18.5 Problem: Josephus Problem (Problem ID: JOSEPHUS, Difficulty: Easy)\u003cbr\u003e __18.6 Solution: Josephus Problem\u003cbr\u003e __18.7 Further Reading\u003cbr\u003e\u003cbr\u003e Chapter 19: Queues, Stacks, and Decks\u003cbr\u003e __19.1 Introduction\u003cbr\u003e __19.2 Implementation of Queues, Stacks, and Decks  \u003cbr\u003e__19.3 Using Stacks and Queues\u003cbr\u003e __19.4 Problem: Mismatched Parentheses (Problem ID: BRACKETS2, Difficulty: Easy)\u003cbr\u003e __19.5 Solution: Mismatched parentheses\u003cbr\u003e __19.6 Problem: Analyzing Extraterrestrial Signals (Problem ID: ITES, Difficulty: Medium)\u003cbr\u003e __19.7 Solution: Analyzing Extraterrestrial Signals\u003cbr\u003e\u003cbr\u003e 20-character string\u003cbr\u003e __20.1 Introduction\u003cbr\u003e __20.2 String Search\u003cbr\u003e __20.3 Problem: Jaeha's Safe (Problem ID: JAEHASAFE, Difficulty: Medium)\u003cbr\u003e __20.4 Solution: Jaeha's Safe\u003cbr\u003e __20.5 Suffix Array\u003cbr\u003e __20.6 Problem: Habits (Problem ID: HABIT, Difficulty: Medium)\u003cbr\u003e __20.7 Solution: Habits\u003cbr\u003e __20.8 Further Reading\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePart 6 Tree\u003c\/b\u003e\u003cbr\u003e __survey\u003cbr\u003e\u003cbr\u003e Chapter 21: Tree Implementation and Traversal\u003cbr\u003e __21.1 Introduction\u003cbr\u003e __21.2 Tree Traversal\u003cbr\u003e __21.3 Problem: Changing the Tree Traversal Order (Problem ID: TRAVERSAL, Difficulty: Easy)\u003cbr\u003e __21.4 Solution: Changing the tree traversal order\u003cbr\u003e __21.5 Problem: Fortress (Problem ID: FORTRESS, Difficulty: Medium)\u003cbr\u003e __21.6 Solution: Fortress\u003cbr\u003e\u003cbr\u003e Chapter 22 Binary Search Trees\u003cbr\u003e __22.1 Introduction\u003cbr\u003e __22.2 Definition and manipulation of binary search trees\u003cbr\u003e __22.3 Time Complexity Analysis and Balanced Binary Search Trees  \u003cbr\u003e__22.4 Problem: Nerd or Not Nerd? 2 (Problem ID: NERD2, Difficulty: Medium)\u003cbr\u003e __22.5 Solution: Nerd or Not Nerd? 2\u003cbr\u003e __22.6 Implementing a Balanced Binary Search Tree Yourself: Trip\u003cbr\u003e __22.7 Problem: Reversing Insertion Sort (Problem ID: INSERTION, Difficulty: Medium)\u003cbr\u003e __22.8 Solution: Reversing Insertion Sort\u003cbr\u003e\u003cbr\u003e Chapter 23: Priority Queues and Heaps\u003cbr\u003e __23.1 Introduction\u003cbr\u003e __23.2 Definition and implementation of heap\u003cbr\u003e __23.3 Problem: Changing Median (Problem ID: RUNNINGMEDIAN, Difficulty: Easy)\u003cbr\u003e __23.4 Solution: Changing Intermediate Values\u003cbr\u003e\u003cbr\u003e 24-Chapter Interval Tree\u003cbr\u003e __24.1 Interval Tree: Answering Questions About Intervals\u003cbr\u003e __24.2 Problem: Hiking Trail (Problem ID: MORDOR, Difficulty: Medium)\u003cbr\u003e __24.3 Solution: Hiking Trail\u003cbr\u003e __24.4 Problem: Family Tree Exploration (Problem ID: FAMILYTREE, Difficulty: High)\u003cbr\u003e __24.5 Solution: Exploring the Genealogy\u003cbr\u003e __24.6 Fenwick Tree: Fast and Simple Interval Sums\u003cbr\u003e __24.7 Problem: Measuring Insertion Sort Time (Problem ID: MEASURETIME, Difficulty: Medium)\u003cbr\u003e __24.8 Solution: Measuring Insertion Sort Time\u003cbr\u003e\u003cbr\u003e Chapter 25 Mutually Exclusive Sets\u003cbr\u003e __25.1 Introduction  \u003cbr\u003e__25.2 Problem: Editor Wars (Problem ID: EDITORWARS, Difficulty: Medium)\u003cbr\u003e __25.3 Solution: Editor Wars\u003cbr\u003e\u003cbr\u003e Chapter 26 Try\u003cbr\u003e __26.1 Introduction\u003cbr\u003e __26.2 Problem: Goodbye, and thanks for the fish! (Problem ID: SOLONG, Difficulty: Medium)\u003cbr\u003e __26.3 Solution: Goodbye, and thanks for the fish!\u003cbr\u003e __26.4 Multi-string search using Trie\u003cbr\u003e __26.5 Problem: Security Terminator (Problem ID: NH, Difficulty: High)\u003cbr\u003e __26.6 Solution: Security Terminator\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePart 7 graph\u003c\/b\u003e\u003cbr\u003e __survey\u003cbr\u003e\u003cbr\u003e Chapter 27: Representation and Definition of Graphs\u003cbr\u003e __27.1 Introduction\u003cbr\u003e __27.2 Example of using graphs\u003cbr\u003e __27.3 Implicit Graph Structures\u003cbr\u003e __27.4 How to Represent Graphs\u003cbr\u003e\u003cbr\u003e Chapter 28: Depth-First Search of Graphs\u003cbr\u003e __28.1 Introduction\u003cbr\u003e __28.2 Problem: Ancient Dictionary (Problem ID: DICTIONARY, Difficulty: Easy)\u003cbr\u003e __28.3 Explanation: Ancient Language Dictionary\u003cbr\u003e __28.4 Euler Circuit\u003cbr\u003e __28.5 Problem: Word Chain (Problem ID: WORDCHAIN, Difficulty: Easy)\u003cbr\u003e __28.6 Solution: Word Limit Ending Game\u003cbr\u003e __28.7 Theoretical Background and Applications  \u003cbr\u003e__28.8 Problem: Installing a Surveillance Camera (Problem ID: GALLERY, Difficulty: Medium)\u003cbr\u003e __28.9 Solution: Installing a surveillance camera\u003cbr\u003e __28.10 Problem: Meeting Room Assignment (Problem ID: MEETINGROOM, Difficulty: High)\u003cbr\u003e __28.11 Solution: Conference Room Assignment\u003cbr\u003e\u003cbr\u003e Chapter 29: Breadth-First Search of Graphs\u003cbr\u003e __29.1 Introduction\u003cbr\u003e __29.2 Problem: Sorting Game (Problem ID: SORTGAME, Difficulty: Medium)\u003cbr\u003e __29.3 Solution: Sorting Game\u003cbr\u003e __29.4 Problem: Children's Day (Problem ID: CHILDRENDAY, Difficulty: High)\u003cbr\u003e __29.5 Explanation: Children's Day\u003cbr\u003e __29.6 Shortest Path Strategy\u003cbr\u003e __29.7 Problem: Tower of Hanoi (Problem ID: HANOI4B, Difficulty: Medium)\u003cbr\u003e __29.8 Solution: Tower of Hanoi\u003cbr\u003e\u003cbr\u003e Chapter 30: Shortest Path Algorithm\u003cbr\u003e __30.1 Introduction\u003cbr\u003e __30.2 Dijkstra's shortest path algorithm\u003cbr\u003e __30.3 Problem: Signal Routing (Problem ID: ROUTING, Difficulty: Easy)\u003cbr\u003e __30.4 Solution: Signal Routing\u003cbr\u003e __30.5 Problem: Fire Truck (Problem ID: FIRETRUCKS, Difficulty: Medium)\u003cbr\u003e __30.6 Solution: Fire Truck\u003cbr\u003e __30.7 Problem: Ironman N-Trial (Problem ID: NTHLON, Difficulty: High)\u003cbr\u003e __30.8 Solution: Ironman N-Trial Race  \u003cbr\u003e__30.9 Bellman-Ford shortest path algorithm\u003cbr\u003e __30.10 Problem: Time Travel (Problem ID: TIMETRIP, Difficulty: Medium)\u003cbr\u003e __30.11 Solution: Time Travel\u003cbr\u003e __30.12 Floyd's all-pairs shortest distance algorithm\u003cbr\u003e __30.13 Problem: Drunk Driving Crackdown (Problem ID: DRUNKEN, Difficulty: Medium)\u003cbr\u003e __30.14 Solution: Drunk Driving Crackdown\u003cbr\u003e __30.15 Problem: Election Promises (Problem ID: PROMISES, Difficulty: Medium)\u003cbr\u003e __30.16 Explanation: Election promise\u003cbr\u003e\u003cbr\u003e Chapter 31 Minimum Spanning Tree\u003cbr\u003e __31.1 Introduction\u003cbr\u003e __31.2 Kruskal's minimum spanning tree algorithm\u003cbr\u003e __31.3 Prim's Minimum Spanning Tree Algorithm\u003cbr\u003e __31.4 Problem: Local Area Network (Problem ID: LAN, Difficulty: Easy)\u003cbr\u003e __31.5 Solution: Short-Range Network\u003cbr\u003e __31.6 Problem: Determining a Travel Route (Problem ID: TPATH, Difficulty: High)\u003cbr\u003e __31.7 Solution: Determining a Travel Route\u003cbr\u003e\u003cbr\u003e Chapter 32 Network Flow\u003cbr\u003e __32.1 Introduction\u003cbr\u003e __32.2 Ford-Fulkerson Algorithm\u003cbr\u003e __32.3 Network Modeling\u003cbr\u003e __32.4 Problem: Match Fixing (Problem ID: MATCHFIX, Difficulty: Medium)\u003cbr\u003e __32.5 Solution: Match Fixing  \u003cbr\u003e__32.6 Problem: National Projects (Problem ID: PROJECTS, Difficulty: High)\u003cbr\u003e __32.7 Solution: National Project\u003cbr\u003e __32.8 Bipartite Matching\u003cbr\u003e __32.9 Problem: Bishop (Problem ID: BISHOPS, Difficulty: Medium)\u003cbr\u003e __32.10 Solution: Bishop\u003cbr\u003e __32.11 Problem: Setting a Trap (Problem ID: TRAPCARD, Difficulty: High)\u003cbr\u003e __32.12 Solution: Setting a trap\u003cbr\u003e __32.13 More to study\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003ePublisher's Review\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e This book is designed to help you learn about various algorithm design techniques and data structures while solving programming competition problems, and further develop your problem-solving skills.\u003cbr\u003e Each chapter includes practice problems that readers can write and grade on their own, and each practice problem is accompanied by sample answers and detailed explanations of the process of designing the answer.\u003cbr\u003e\u003cbr\u003e What this book covers\u003cbr\u003e Part 1: Getting Started with Troubleshooting\u003cbr\u003e Part 2 Algorithm Analysis\u003cbr\u003e Part 3: Algorithm Design Paradigms\u003cbr\u003e Part 4: Famous Algorithms\u003cbr\u003e Part 5: Basic Data Structures\u003cbr\u003e Part 6 Tree\u003cbr\u003e Part 7 graph\u003cbr\u003e \u003cbr\u003eErrata and source code can be found on this book's homepage (http:\/\/book.algospot.com). \u003cbr\u003e\n\n\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e GOODS SPECIFICS \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eDate of publication:\u003c\/strong\u003e November 21, 2012\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003ePage count, weight, size:\u003c\/strong\u003e 1,062 pages | 188*240*60mm\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN13:\u003c\/strong\u003e 9788966260546\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN10:\u003c\/strong\u003e 8966260543 \u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cspan\u003e\u003c\/span\u003e\n\n\u003c\/center\u003e\n\n\n\u003c\/center\u003e","brand":"LIBRAIRIE COREENNE","offers":[{"title":"Default Title","offer_id":43893203927082,"sku":"138146","price":56.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0683\/2750\/5962\/files\/bddbf47c69cda39010a2d252d392ef0c.jpg?v=1765391861","url":"https:\/\/librairie.coreenne.fr\/en\/products\/138146","provider":"LIBRAIRIE COREENNE","version":"1.0","type":"link"}