UVA 116 Unidirectional TSP 求最小路线 DP
来源:互联网 发布:大麻种子 淘宝 编辑:程序博客网 时间:2024/06/16 06:12
点击打开链接
http://www.bnuoj.com/v3/problem_show.php?pid=17255
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 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 63 4 1 2 8 66 1 8 2 7 45 9 3 9 9 58 4 1 3 2 63 7 2 8 6 45 63 4 1 2 8 66 1 8 2 7 45 9 3 9 9 58 4 1 3 2 63 7 2 1 2 32 29 10 9 10
Sample Output
1 2 3 4 4 5161 2 1 5 4 5111 119
/*给定m行n列,求从左到右的最小路径DP求解*/#include<cstdio>#include<iostream>#include<algorithm>#define INF 0x3f3f3f3fusing namespace std;int main(){ int n,m,i,j,k; while(~scanf("%d%d",&m,&n)) { int a[15][105],dp[15][105],next[15][105],ans=INF,first=0; for(i=0; i<m; i++) for(j=0; j<n; j++) scanf("%d",&a[i][j]); for(j=n-1; j>=0; j--)//逆推 for(i=0; i<m; i++) { if(j==n-1) dp[i][j]=a[i][j];//右边界 else{ int rows[3]={i,i-1,i+1}; if(i==0) rows[1]=m-1;// if(i==m-1) rows[2]=0;//上下边界 sort(rows,rows+3);//排序,以求最小字典序 dp[i][j]=INF; for(k=0;k<3;k++) { int v=dp[rows[k]][j+1]+a[i][j]; if(v<dp[i][j]) { dp[i][j]=v; next[i][j]=rows[k]; }//next保存路劲 } } if(j==0&&ans>dp[i][j]) {ans=dp[i][j];first=i; } //第一列的起点 } printf("%d",first+1); for(i=next[first][0],j=1;j<n;i=next[i][j],j++) printf(" %d",i+1); printf("\n%d\n",ans); } return 0;}
- UVA 116 Unidirectional TSP 求最小路线 DP
- dp uva-116-Unidirectional TSP
- UVa 116 Unidirectional TSP (DP)
- UVA 116 Unidirectional TSP (DP)
- UVa 116 - Unidirectional TSP(DP)
- Uva-116 Unidirectional TSP DP
- Unidirectional TSP - UVa 116 dp
- 【DP】UVA 116 Unidirectional TSP
- UVa 116 - Unidirectional TSP(dp)
- UVa 116 Unidirectional TSP(DP)
- DP--UVA - 116 Unidirectional TSP
- Uva--116 Unidirectional TSP(dp)
- UVA 116 Unidirectional TSP [DP]
- UVA 116 Unidirectional TSP(dp)
- UVA 116 Unidirectional TSP 经典dp题
- uva 116(Unidirectional TSP)(DP)
- uva 116 Unidirectional TSP (dp)
- UVa 116 Unidirectional TSP(DP)
- 浅析CVE-2012-4220
- 关于Web前端密码加密是否有意义的总结!
- listview 中的不同 item 实现
- nyoj-139 我排第几个
- require include require_ones的区别
- UVA 116 Unidirectional TSP 求最小路线 DP
- Adobe 官方公布的 RTMP 规范
- 第26讲—项目4—本月有多少天
- 在Ubuntu 14.04 64bit上安装字体管理器font-manager
- win8.1 rJAVA和Rwordseg安装
- JXL操作Excel
- Google Code Jam Qualification Round 2015 Problem B. Infinite House of Pancakes
- Swift学习开始啦--基础(一)
- opencv2.4.9(10)配置