设平面上有一个m´ n的网格，将左下角的网格点标记为（0,0）而右上角的网格点标记为（m,n）。某人想从（0,0）出发沿网格线行进到达（m,n），但是在网格点（i,j）处他只能向上行进或者向右行进，向上行进的代价为aij（amj ＝＋¥ ），向右行进的代价是bij（bin ＝＋¥ ）。试设计一个动态规划算法，在这个网格中为该旅行者寻找一条代价最小的旅行路线。用高级程序设计语言编写程序求解动态规划模型。-Set up a plane m　n of the grid, will be the lower-left corner of the grid points marked as (0,0) and the upper right corner of the grid point marked as (m, n). A person from (0,0) along the starting grid to reach the road (m, n), but the grid point (i, j) Department only him right up the road or the road, up the road price for the aij ( amj =　 ￥), the road to the right price is bij (bin =　 ￥). Try to design a dynamic programming algorithm, in this grid for travelers to find a minimum cost of travel routes. Advanced programming language used to write programs to solve dynamic programming model.