UVa 116 Unidirectional TSP

题目链接：点击打开链接

紫书上的分类叫多段图的最短路，其实思路很简单，转移到下一个位置时考虑右上、右下、直行。其中右上和右下需考虑边界问题。WA点：打印路径时要从dp[i][1]里找（列是1~n），从dp[i][0]里找的怎么调都过不了。。。。代码如下：

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int INF=1<<30;
int dp[15][105],a[15][105],path[15][105];
int main()
{
    int m,n,t,temp;
    while(scanf("%d %d",&m,&n)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        memset(a,0,sizeof(a));
        for(int i=0;i<m;++i)
            for(int j=1;j<=n;++j) scanf("%d",&a[i][j]);
        temp=INF;
        for(int j=n;j>=1;--j)
        {

            for(int i=0;i<m;++i)
            {
                if(j==n) { dp[i][j]=a[i][j]; }
                else
                {
                    dp[i][j]=dp[i][j+1]+a[i][j],path[i][j]=i;
                    for(int k=-1;k<2;++k)
                    {
                        if(dp[i][j]>dp[(m+i+k)%m][j+1]+a[i][j])
                        {
                            dp[i][j]=dp[(m+i+k)%m][j+1]+a[i][j];
                            path[i][j]=(m+i+k)%m;
                        }
                        else if(dp[i][j]==dp[(m+i+k)%m][j+1]+a[i][j])
                        {
                            path[i][j]=min(path[i][j],(m+i+k)%m);
                        }
                    }
                }
                if(j==1&&dp[i][j]<temp) t=i,temp=dp[i][j];
            }
        }
        int p=t;
        for(int i=1;i<=n;++i)
        {
            printf("%d",t+1);
            t=path[t][i];
            if(i!=n) printf(" ");
        }
        printf("\n%d\n",temp);
    }
    return 0;
}