UVA116 Unidirectional TSP 单向TSP

分阶段的DAG，注意字典序的处理和路径的保存。

定义状态d[i][j]为从i,j 出发到最后一列的最小花费，转移的时候只有三种，向上，向下，或平移。

#include<bits/stdc++.h>
using namespace std;

const int maxm = ;
const int maxn = ;

int G[maxm][maxn];
const int INF = 1e9;
int d[maxm][maxn];
int path[maxn][maxn];

int main()
{
    //freopen("in.txt","r",stdin);
    int m,n;
    while(~scanf("%d%d",&m,&n)){
        for(int i = ; i < m; i++)
        for(int j = ; j < n ;j++){
            scanf("%d",G[i]+j);
        }
        int ans = INF,head = ;
        for(int i = ; i < m; i++) d[i][n-] = G[i][n-];
        if(n == ){
            for(int i = ; i < m; i++){
                if(d[i][]<ans) { ans = d[i][]; head = i; }
            }
        }else {
            for(int j = n-; j >= ; j--){
                for(int i = ; i < m; i++){
                    int nxt[] = {i,i+,i-};
                    if(i == ) nxt[] = m-;
                    if(i == m-) nxt[] = ;
                    sort(nxt,nxt+);
                    d[i][j] = d[nxt[]][j+];
                    path[i][j] = nxt[];
                    for(int k = ; k < ; k++){
                        int t = d[nxt[k]][j+];
                        if(t < d[i][j]){
                            d[i][j] = t; path[i][j] = nxt[k];
                        }
                    }
                    d[i][j] += G[i][j];
                    if(j ==  && d[i][j] < ans) { ans = d[i][j]; head = i; }
                }
            }
        }

        printf("%d",head+);
        for(int i = path[head][],j = ; j < n; i = path[i][j], j++){
            printf(" %d",i+);
        }
        printf("\n%d\n",ans);
    }
    return ;
}