uva 116 Unidirectional TSP
来源:互联网 发布:淘宝代销图片怎么编辑 编辑:程序博客网 时间:2024/06/05 03:50
题目:
G - Unidirectional TSP
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status Practice UVA 116
Description
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 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
题目大意:
给一个图,求从左到右的最小值,只能往右上,右下,右边这三个方向.求其最小值.如果多个值,求字典序最小的.注意最上边和最下边是连着的
题目思路:
1、因为后面的选择不改变前面的状态,可以用dp
2、因为要求字典序,我们可以反向求,即从右到左.
3、我们可以多开一组,确定来源位置,方便求答案.
4、注意宽度为1的情况
程序:
#include<cstdio>#include<algorithm>#include<iostream>#include<cstring>using namespace std;int a[110][110];int v[110][110];int n,m;void maxx (int x,int y){ if(x==0)//最上边 { int w=x,da=a[x][y+1]; if(a[x+1<n?x+1:0][y+1]<da) { w=x+1<n?x+1:0; da=a[x+1<n?x+1:0][y+1]; } if(a[n-1][y+1]<da) { w=n-1; da=a[n-1][y+1]; } a[x][y]+=da; v[x][y]=w; } else if(x==n-1)//最下边 { int w=0,da=a[0][y+1]; if(a[x-1][y+1]<da) { w=x-1; da=a[x-1][y+1]; } if(a[x][y+1]<da) { w=x; da=a[x][y+1]; } a[x][y]+=da; v[x][y]=w; } else //其他 { int w=x-1,da=a[x-1][y+1]; if(a[x][y+1]<da) { w=x; da=a[x][y+1]; } if(a[x+1][y+1]<da) { w=x+1; da=a[x+1][y+1]; } a[x][y]+=da; v[x][y]=w;//标记位置 }}int main (){ int i,j,k,da,w; int t[110]; while(~scanf("%d %d",&n,&m)) { for(i=0; i<n; i++) for(j=0; j<m; j++) scanf("%d",&a[i][j]);//输入 for(j=m-2; j>=0; j--)//从右往左 for(i=0; i<n; i++) maxx(i,j);//求答案 da=a[0][0],w=0; for(i=1; i<n; i++) if(a[i][0]<da) { da=a[i][0];//寻找答案 w=i; } printf("%d",w+1); for(j=0; j<m-1; j++) { w=v[w][j]; printf(" %d",w+1);//输出答案 } printf("\n%d\n",da); } return 0;}
- UVa 116 Unidirectional TSP
- UVA 116 - Unidirectional TSP
- UVa 116 - Unidirectional TSP
- uva 116 Unidirectional TSP
- UVa 116Unidirectional TSP
- UVa 116 - Unidirectional TSP
- Uva 116 - Unidirectional TSP
- UVa 116 - Unidirectional TSP
- Uva - 116 - Unidirectional TSP
- UVa 116 - Unidirectional TSP
- uva 116 - Unidirectional TSP
- UVa:116 Unidirectional TSP
- uva 116 Unidirectional TSP
- UVa 116 - Unidirectional TSP
- uva 116 Unidirectional TSP
- uva 116 Unidirectional TSP
- UVA-116 - Unidirectional TSP
- UVa 116 - Unidirectional TSP
- 《java入门第一季》之类(Scanner类)
- Android studio 学习网站
- hdu1423Greatest Common Increasing Subsequence(最长公共递增子序列)
- 《C++精英内参-程序员高效指南》-8杂乱信息的处理
- sdsdaas
- uva 116 Unidirectional TSP
- 【项目源码】- 【模仿知乎日报】模仿知乎日报
- shop++ 4.0系统 一对多,多对一 ,多对多关系配置(个人心得和一些见解)
- namespace 的使用
- js运动原理
- ImageMagick爆高危命令执行漏洞
- bzoj3223 文艺平衡树 treap
- shop++ JPA 注解详解
- markdown编译器