钻石矿工

代码说明：

  算法设计中的钻石矿工问题在一座金字塔每块石头上都镶有一块钻石从金字塔的顶端向下收集钻石尽可能收集价值高的钻石，每层每次只能从一块砖斜向左下或斜向右下走到另一块砖上。设计算法求出获取的钻石最大价值及路径。（动态规划）(The problem of diamond miner in algorithm design is set up on every stone in Pyramid. A diamond is collected from the top of Pyramid. Diamond is collected as high as possible. Every layer can only lean from one brick to the left or to the right to go to the next brick at a time. The design algorithm is used to find the maximum value and path of the obtained diamond. (dynamic programming))

文件列表：

金字塔(动态规划) 截图.png, 19139 , 2017-05-31
金字塔(动态规划).cpp, 2055 , 2017-05-31