2015 Multi-University Training Contest 9 G（hdu5402 Travelling Salesman Problem）

roblem Description Teacher Mai is in a maze with n rows and m columns. There is a non-negative number in each cell. Teacher Mai wants to walk from the top left corner (1,1) to the bottom right corner 

>>阅读原文<<