算法设计与分析基础第三版第八章.pptVIP

Design and Analysis of Algorithms - Chapter 8 Dynamic Programming Example 1: Fibonacci numbers Example 1: Fibonacci numbers (cont.) Example 2: Coin-row problem DP solution to the coin-row problem DP solution to the coin-row problem (cont.) Example 3: Path counting Consider the problem of counting the number of shortest paths from point A to point B in a city with perfectly horizontal streets and vertical avenues Example 4: Coin-collecting by robot Several coins are placed in cells of an n×m board. A robot, located in the upper left cell of the board, needs to collect as many of the c