uva 116 Unidirectional (单向)TSP

这是道简单多段图DP问题~~
超简单的~所以就没找问题描述~
找了个题意描述~~

题意：给一个n*m的矩阵，表示到达每一个方格的代价，第i列上的元素可以走到i+1列的与它最近的三个格子。问从第1列到第m列，最小的代价是多少并输出所走路径的行编号。

#include<iostream>
#include<algorithm>
using namespace std;

const int maxm = 10+5;
const int maxn = 100+5;
const int INF = 2147483647;
int m,n;
int map[maxm][maxn];
int next[maxm][maxn];
int d[maxm][maxn];

int main()
{
    cin >> m >> n;
    for(int i = 0; i < m ; i++ )
        for(int j = 0 ; j < n ; j++ )
            cin >> map[i][j];
    int ans=INF,first=0;
    for(int j = n-1 ; j >= 0 ; j-- )
        for(int i = 0 ; i < m ; i++ )
        {
            if(j == n-1)d[i][j]=map[i][j];
            else
            {
                int rows[3] = {i,i+1,i-1};
                if(i == m-1)rows[1] = 0;
                if(i == 0)rows[2] = m-1;
                sort(rows,rows+3);
                d[i][j] = INF;
                for(int k = 0 ; k < 3 ; k++ )
                    if(d[i][j]>d[rows[k]][j+1]+map[i][j])
                    {
                        d[i][j] = d[rows[k]][j+1]+map[i][j];
                        next[i][j] = rows[k];
                    }
                if(j==0&&d[i][j]<ans)
                {
                    ans = d[i][j];
                    first = i;
                }
            }
        }
        cout << first+1;
        for(int i = next[first][0],j = 1; j < n ; i = next[i][j],j++)
        cout << " " << i+1 ;
        cout << endl << ans;
        return 0;
}