摘要： 题目：Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6044Accepted Submission(s): 1527Problem DescriptionThese are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there i 阅读全文