| 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 
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 
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 
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 nintegers (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
题意：给定一个矩阵。求出从左到右权值和最小的路径，每次有3种方式，且可以跨边界。如图，
思路：dp，数塔问题的变形。。只要注意保存下输出路径要按字典序，所以要从右往左储存。
代码：
#include <stdio.h>
#include <string.h> int n, m, map[105][105], i, j, ans, out[105][105], outi;
int min(int a, int b) {
return a < b ? a : b;
}
int main() {
while (~scanf("%d%d", &n, &m)) {
ans = 999999999; outi = 0;
memset(out, -1, sizeof(out));
for (i = 0; i < n; i ++)
for (j = 0; j < m; j ++) {
scanf("%d", &map[i][j]);
}
for (j = m - 2; j >= 0; j --) {
for (i = 0; i < n; i ++) {
int a, b, c, ai, bi, ci;
if (i == 0) {
a = map[n - 1][j + 1];
ai = n - 1;
}
else {
a = map[i - 1][j + 1];
ai = i - 1;
}
b = map[i][j + 1];
bi = i;
if (i == n - 1) {
c = map[0][j + 1];
ci = 0;
}
else {
c = map[i + 1][j + 1];
ci = i + 1;
}
if (map[i][j] + a <= map[i][j] + b && map[i][j] + a <= map[i][j] + c) {
map[i][j] += a;
out[i][j] = ai;
if (map[i][j] + a == map[i][j] + b) {
out[i][j] = min(min(ai, bi), out[i][j]);
}
if (map[i][j] + a == map[i][j] + c) {
out[i][j] = min(min(ai, ci), out[i][j]);
}
}
else if (map[i][j] + b <= map[i][j] + a && map[i][j] + b <= map[i][j] + c) {
map[i][j] += b;
out[i][j] = bi;
if (map[i][j] + a == map[i][j] + b) {
out[i][j] = min(min(ai, bi), out[i][j]);
}
if (map[i][j] + b == map[i][j] + c) {
out[i][j] = min(min(bi, ci), out[i][j]);
}
}
else if (map[i][j] + c <= map[i][j] + b && map[i][j] + c <= map[i][j] + a) {
map[i][j] += c;
out[i][j] = ci;
if (map[i][j] + a == map[i][j] + c) {
out[i][j] = min(min(ai, ci), out[i][j]);
}
if (map[i][j] + b == map[i][j] + c) {
out[i][j] = min(min(bi, ci), out[i][j]);
}
}
}
}
for (i = 0; i < n; i ++) {
if (ans > map[i][0]) {
ans = map[i][0];
outi = i;
}
}
int sb = 0;
printf("%d", outi + 1);
while (out[outi][sb] != -1) {
printf(" %d", out[outi][sb] + 1);
outi = out[outi][sb];
sb ++;
}
printf("\n");
printf("%d\n", ans);
}
return 0;
}