设平面上有一个m×n 的网格，将左下角的网格点标记为（0,0）而右上角的网格点标记为（m,n）。某人想从（0,0）出发沿网格线行进到达（m,n），但是在网格点（i,j）处他只能向上行进或者向右行进，向上行进的代价为aij（amj ＝＋∞），向右行进的代价是bij（bin ＝＋∞）。试设计一个动态规划算法，在这个网格中为该旅行者寻找一条代价最小的旅行路线。(There is a m * n mesh on the plane, and the grid point on the lower left is marked (0,0), and the grid point on the upper right is marked as (m, n). Want sb (0,0) starting from marching along the mesh line at (m, n), but in the grid point (I, J) where he can only travel up or to travel on the road to the right, the price for AIJ (AMJ = 2), the road to the right is the price of bij (bin = 2). A dynamic programming algorithm is designed to find the least cost travel route for the traveler in this grid.)