[多段图] Unidirectional TSP UVa116

题意

给一个m行n列的整数矩阵，从第一列的任何位置出发每次向右、右上、右下移动一格，最终到达最后一列。求走过的整数之和最小。

题解

简单dp，注意答案还要求字典序最小。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

const int maxn = 100+1;
const int INF = 0x3f3f3f3f;

typedef pair<int,int> pii;


int n,m;
int p[maxn][maxn],mp[maxn][maxn],dp[maxn][maxn];


int main(){
    while(scanf("%d%d", &m,&n) != EOF){
        for(int i = 0; i<m; i++)
        for(int j = 0; j<n; j++)
            scanf("%d", &mp[i][j]);
        for(int i = 0; i<m; i++)
            dp[n-1][i] = mp[i][n-1];
        for(int i = n-2; i>=0; i--){
            for(int j = 0; j<m; j++){
                p[i][j] = dp[i][j] = INF;
                for(int k = -1; k<=1; k++){
                    int z = j+k;
                    if(z<0) z += m;
                    if(dp[i][j]>dp[i+1][z%m]){
                        dp[i][j] = dp[i+1][z%m];p[i][j] = z%m;
                    }
                    if(dp[i][j]==dp[i+1][z%m]&&p[i][j]>z%m)p[i][j] = z%m;
                }
                dp[i][j] += mp[j][i];
            }
        }
        int pos, ans=INF;
        for(int i = m-1; i>=0; i--)if(ans>=dp[0][i]){
            ans = dp[0][i];pos = i;
        }
        printf("%d", pos+1);
        for(int i = 0; i<n-1; i++){
            printf(" %d", p[i][pos]+1);
            pos = p[i][pos];
        }
        printf("\n%d\n", ans);
    }
    return 0;
}