hdu5067Harry And Dig Machine(TSP旅行商問題)
題目鏈接：
huangjing
題意：給出一幅圖，圖中有一些點，然後從第1個點出發，然後途徑所有有石頭的點，最後回到原點，然後求最小距離。當初作比賽的時候不知道這就是旅行商經典問題。回來學了一下。
思路:
狀態轉移方程
DP[k][i|base[k]]=min(DP[k][i|base[k]],DP[j][i]+dis[j][k])
DP[J][I]表示從起點到j點在i狀態下的最小距離。。。DP[j][i]+dis[j][k]表從j到k的距離。。。時間復雜度是(n?m+(t2)?(2t)），那麼問題就得到了解決。。
題目：
Harry And Dig Machine
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 453 Accepted Submission(s): 164
Problem Description
As we all know, Harry Porter learns magic at Hogwarts School. However, learning magical knowledge alone is insufficient to become a great magician. Sometimes, Harry also has to gain knowledge from other certain subjects, such as language, mathematics, English,
and even algorithm.
Dumbledore, the headmaster of Hogwarts, is planning to construct a new teaching building in his school. The area he selects can be considered as an n*m grid, some (but no more than ten) cells of which might contain stones. We should remove the stones there
in order to save place for the teaching building. However, the stones might be useful, so we just move them to the top-left cell. Taking it into account that Harry learned how to operate dig machine in Lanxiang School several years ago, Dumbledore decides
to let him do this job and wants it done as quickly as possible. Harry needs one unit time to move his dig machine from one cell to the adjacent one. Yet skilled as he is, it takes no time for him to move stones into or out of the dig machine, which is big
enough to carry infinite stones. Given Harry and his dig machine at the top-left cell in the beginning, if he wants to optimize his work, what is the minimal time Harry needs to finish it?
Input
They are sever test cases, you should process to the end of file.
For each test case, there are two integers n and m.
(1≤n,m≤50).
The next n line, each line contains m integer. The j-th number of
ith line
a[i][j] means there are a[i][j] stones on the
jth cell
of the
ith line.(
0≤a[i][j]≤100 ,
and no more than 10 of a[i][j] will be positive integer).
Output
For each test case, just output one line that contains an integer indicate the minimal time that Harry can finish his job.
Sample Input
3 3
0 0 0
0 100 0
0 0 0
2 2
1 1
1 1
Sample Output
4
4
Source
BestCoder Round #14
Recommend
heyang | We have carefully selected several similar problems for you: 5069 5068 5065 5064 5061
Statistic | Submit | Discuss | Note
代碼：
#include
#include
#include
#include
#include
