poj 2353（简单dp+输出路径）

Ministry

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4808		Accepted: 1549		Special Judge

Description

Mr. F. wants to get a document be signed by a minister. A minister signs a document only if it is approved by his ministry. The ministry is an M-floor building with floors numbered from 1 to M, 1<=M<=100. Each floor has N rooms (1<=N<=500) also numbered from 1 to N. In each room there is one (and only one) official. 

A document is approved by the ministry only if it is signed by at least one official from the M-th floor. An official signs a document only if at least one of the following conditions is satisfied: 

a. the official works on the 1st floor; 
b. the document is signed by the official working in the room with the same number but situated one floor below; 
c. the document is signed by an official working in a neighbouring room (rooms are neighbouring if they are situated on the same floor and their numbers differ by one).

Each official collects a fee for signing a document. The fee is a positive integer not exceeding 10^9. 

You should find the cheapest way to approve the document. 

Input

The first line of an input file contains two integers, separated by space. The first integer M represents the number of floors in the building, and the second integer N represents the number of rooms per floor. Each of the next M lines contains N integers separated with spaces that describe fees (the k-th integer at l-th line is the fee required by the official working in the k-th room at the l-th floor).

Output

You should print the numbers of rooms (one per line) in the order they should be visited to approve the document in the cheapest way. If there are more than one way leading to the cheapest cost you may print an any of them.

Sample Input

3 4
10 10 1 10
2 2 2 10
1 10 10 10

Sample Output

3
3
2
1
1

Hint

You can assume that for each official there always exists a way to get the approval of a document (from the 1st floor to this official inclusively) paying no more than 10^9. 

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

题意：n*m的矩阵，输出从第一行走到最后一行的最短路径。可以往下、往左、往右走。

解题思路：由于这题不可能来回走，即到达(i,j)位置，必定直接下来，或者从左边过来，或者从右边过来，不可能先左走一会儿，再右走过来。所以dp[i][j]表示到达(i,j)位置的最小值，分别按照往下走，往左走，往右走扫描一遍即可，注意记录一下路径。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn = 505;
int n,m,map[maxn][maxn];
int dp[maxn][maxn],dir[maxn][maxn];

void print(int x,int y)
{
	if(dir[x][y] == 0)
		print(x-1,y);
	else if(dir[x][y] == 1)
		print(x,y-1);
	else if(dir[x][y] == 2)
		print(x,y+1);
	printf("%d\n",y);
}

int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= m; j++)
				scanf("%d",&map[i][j]);
		for(int i = 1; i <= m; i++)
		{
			dp[1][i] = map[1][i];
			dir[1][i] = -1;
		}
		for(int i = 2; i  <= n; i++)
		{
			for(int j = 1; j <= m; j++)
			{
				dp[i][j] = dp[i-1][j] + map[i][j];
				dir[i][j] = 0;
			}
			for(int j = 2; j <= m; j++)
				if(dp[i][j] > dp[i][j-1] + map[i][j])
				{
					dp[i][j] = dp[i][j-1] + map[i][j];
					dir[i][j] = 1;
				}
			for(int j = m - 1; j >= 1; j--)
				if(dp[i][j] > dp[i][j+1] + map[i][j])
				{
					dp[i][j] = dp[i][j+1] + map[i][j];
					dir[i][j] = 2;
				}
		}
		int pos = 1;
		for(int i = 2; i <= m; i++)
			if(dp[n][i] < dp[n][pos])
				pos = i;
		print(n,pos);
	}
	return 0;
}