UVa 116 - Unidirectional TSP

状态方程：max{ dp[i+1,j+1], dp[i,j+1], dp[i-1,j+1]},路径打印也是利用动归的思想，每个状态下在保证路径权值最小的情况下保证起始行数为较小值。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define inf 0x7FFFFFFF
const int MAXN = 12;
const int MAXN2 = 102;
int dp[MAXN][MAXN2];
int pic[MAXN][MAXN2];
int way[MAXN][MAXN2];
int m, n;
int DP(int i, int j)
{
    if(j >= n)
        return 0;
    if (dp[i][j] != inf)
        return dp[i][j];

    int x = DP(i, j+1);
    int y = DP((i+1)%m, j+1);
    int z = DP((i-1+m)%m, j+1);
    int Min = z, dir = inf;

    if(Min > x)
        Min = x;
    if(Min > y)
        Min = y;

    if(Min == x)
        dir = i;
    if(Min == y)
        dir = min(dir, (i+1)%m);
    if(Min == z)
        dir = min(dir, (i-1+m)%m);

    dp[i][j] = Min + pic[i][j];
    way[i][j] = dir;
    return dp[i][j];
}
int main()
{
#ifdef test
    freopen("input.txt", "r", stdin);
#endif
    int Min, Mi;
    while(scanf("%d%d", &m, &n) != EOF)
    {
        for(int i=0; i<m; ++i)
            for(int j=0; j<n; ++j)
            {
                scanf("%d", &pic[i][j]);
                dp[i][j] = inf;
            }
        Min = inf;
        for(int i=0; i<m; ++i)
        {
            int t = DP(i, 0);
            if(t < Min)
            {
                Mi = i;
                Min = t;
            }
        }

        printf("%d", Mi + 1);
        Mi = way[Mi][0];
        for (int i=1; i<n; ++i)
        {
            printf(" %d", Mi + 1);
            Mi = way[Mi][i];
        }
        printf("\n%d\n", Min);
    }
    return 0;
}