uvaoj 116 Unidirectional TSP 动态规划记录字典序最小路径

116 - Unidirectional TSP

一个m*n的矩阵,每个矩阵有一个整数,定义一条从第1列到第n列的路径,求路径上经过结点整数和的最小值,求出字典序最小的路径.从位置(i,j),可以走到(i,j+1),(i - 1, j + 1), (i + 1, j),第一行和第m行认为相邻.我刚开始写的时候dp[i][j]记录的是以位置(i,j)为终点的最小值,并用pre[i][j]记录前一个列的行号,但是这种方法很难得到字典序最小的路径,因为它找路径的时候是从后往前找的,而字典序比较是从前往后比较的.所以用dp[i][j]表示以位置(i,j)为起点的最小值,从第n列开始逆推就可以得到,并记录下一列的行号,然后找到第一列最小的值,就是答案,沿着路径输出,如果相同就找行号最下的,就可以得到字典序最小的路径.

代码:

/*************************************************************************
	> File Name: 116.cpp
	> Author: gwq
	> Mail: 457781132@qq.com 
	> Created Time: 2014年11月10日 星期一 14时18分42秒
 ************************************************************************/

#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <iostream>
#include <algorithm>

#define INF (INT_MAX / 10)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define pb push_back
#define sz(a) ((int)(a).size())

using namespace std;
typedef set<int> si;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;

#define N 110

ll dp[N][N * N], w[N][N * N], pre[N][N * N], path[N * N], r, c, cnt;

/*
这样写可以得到答案,但是很难找出字典序最小的路径
Input
5 4
1 3 100 100
100 2 1 100
100 100 2 5
100 100 100 4
0 100 100 100
Output
9
1 2 2 3
My output
9
5 1 2 3
*/
int getans(void)
{
	for (ll i = 0; i < r; ++i) {
		dp[i][0] = w[i][0];
		pre[i][0] = -1;
	}
	for (ll j = 1; j < c; ++j) {
		for (ll i = 0; i < r; ++i) {
			ll idx1 = (i - 1 + r) % r;
			ll idx2 = (i + 1) % r;
			//c/c++可以这样初始化
			ll tmp[] = {idx1, idx2, i};
			//将下标从小到大排序
			sort(tmp, tmp + 3);
			//足够大
			dp[i][j] = INF * 100ll;
			pre[i][j] = INF * 100ll;
			for (ll k = 0; k < 3; ++k) {
				if (dp[tmp[k]][j - 1] + w[i][j] < dp[i][j]) {
					pre[i][j] = tmp[k];
					dp[i][j] = dp[tmp[k]][j - 1] + w[i][j];
				}
			}
		}
	}

	ll pos = 0;
	for (ll i = 0; i < r; ++i) {
		if (dp[pos][c - 1] > dp[i][c - 1]) {
			pos = i;
		}
	}
	cnt = 0;
	ll cur = pos;
	while (cur != -1) {
		path[cnt++] = cur + 1;
		cur = pre[cur][c - cnt];
	}
	return dp[pos][c - 1];
}

/*
 * 得从后往前dp，否则，可以得到答案，但是打印不出来字典
 * 序最小的。上边给的例子就是。
 * 字典序是从前到后比较的，所以上边的写法是从后往前比的，
 * 后边的小，前边的不一定小，所以就不能保证是字典序最小的。
 */
int getans2(void)
{
	int idx = c - 1;
	for (ll i = 0; i < r; ++i) {
		dp[i][idx] = w[i][idx];
		pre[i][idx] = -1;
	}
	for (ll j = c - 2; j >= 0; --j) {
		for (ll i = 0; i < r; ++i) {
			ll idx1 = (i - 1 + r) % r;
			ll idx2 = (i + 1) % r;
			//c/c++可以这样初始化
			ll tmp[] = {idx1, idx2, i};
			//足够大
			dp[i][j] = INF * 100ll;
			pre[i][j] = INF * 100ll;
			//将下标从小到大排序
			sort(tmp, tmp + 3);
			for (ll k = 0; k < 3; ++k) {
				if (dp[tmp[k]][j + 1] + w[i][j] < dp[i][j]) {
					pre[i][j] = tmp[k];
					dp[i][j] = dp[tmp[k]][j + 1] + w[i][j];
				}
			}
		}
	}

	ll pos = 0;
	for (ll i = 0; i < r; ++i) {
		if (dp[pos][0] > dp[i][0]) {
			pos = i;
		}
	}
	cnt = 0;
	ll cur = pos;
	while (cur != -1) {
		path[cnt] = cur + 1;
		cur = pre[cur][cnt++];
	}
	return dp[pos][0];
}

int main(int argc, char *argv[])
{
	while (scanf("%lld%lld", &r, &c) != EOF) {
		for (int i = 0; i < r; ++i) {
			for (int j = 0; j < c; ++j) {
				scanf("%lld", &w[i][j]);
			}
		}

		//ll ans = getans();
		ll ans = getans2();
		for (int i = 0; i < cnt; ++i) {
			printf("%lld%c", path[i], (i == cnt - 1) ? '\n' : ' ');
		}
		printf("%lld\n", ans);
	}

	return 0;
}

/*
Unidirectional TSP 

Background
Problems that require minimum paths through some domain appear in many
different areas of computer science. For example, one of the constraints
in VLSI routing problems is minimizing wire length. The Traveling
Salesperson Problem (TSP) -- finding whether all the cities in a
salesperson's route can be visited exactly once with a specified limit on
travel time -- is one of the canonical examples of an NP-complete problem;
solutions appear to require an inordinate amount of time to generate,
but are simple to check.

This problem deals with finding a minimal path through a grid of points
while traveling only from left to right.

The Problem
Given an  tex2html_wrap_inline352 matrix of integers, you are to write a
program that computes a path of minimal weight. A path starts anywhere
in column 1 (the first column) and consists of a sequence of steps
terminating in column n (the last column). A step consists of traveling
from column i to column i+1 in an adjacent (horizontal or diagonal) row.
The first and last rows (rows 1 and m) of a matrix are considered adjacent,
i.e., the matrix ``wraps'' so that it represents a horizontal cylinder.
Legal steps are illustrated below.

The weight of a path is the sum of the integers in each of the n cells of
the matrix that are visited.

For example, two slightly different  tex2html_wrap_inline366 matrices are
shown below (the only difference is the numbers in the bottom row).

The minimal path is illustrated for each matrix. Note that the path for the
matrix on the right takes advantage of the adjacency property of the first
and last rows.

The Input
The input consists of a sequence of matrix specifications. Each matrix
specification consists of the row and column dimensions in that order on a
line followed by  tex2html_wrap_inline376 integers where m is the row
dimension and n is the column dimension. The integers appear in the input in
row major order, i.e., the first n integers constitute the first row of the
matrix, the second n integers constitute the second row and so on. The
integers on a line will be separated from other integers by one or more
spaces. Note: integers are not restricted to being positive. There will be
one or more matrix specifications in an input file. Input is terminated by
end-of-file.

For each specification the number of rows will be between 1 and 10 inclusive;
the number of columns will be between 1 and 100 inclusive. No path's weight
will exceed integer values representable using 30 bits.

The Output

Two lines should be output for each matrix specification in the input file,
the first line represents a minimal-weight path, and the second line is the
cost of a minimal path. The path consists of a sequence of n integers
(separated by one or more spaces) representing the rows that constitute the
minimal path. If there is more than one path of minimal weight the path that
is lexicographically smallest should be output.

Sample Input
5 6
3 4 1 2 8 6
6 1 8 2 7 4
5 9 3 9 9 5
8 4 1 3 2 6
3 7 2 8 6 4
5 6
3 4 1 2 8 6
6 1 8 2 7 4
5 9 3 9 9 5
8 4 1 3 2 6
3 7 2 1 2 3
2 2
9 10 9 10

Sample Output
1 2 3 4 4 5
16
1 2 1 5 4 5
11
1 1
19
*/