摘要:
Problem DescriptionMy name is Hu Bayi, robing an ancient tomb in Tibet. The tomb consists of N rooms (numbered from 1 to N) which are connected by some roads (pass each road should cost some time). There is exactly one route between any two rooms, and each room contains some treasures. Now I am loca 阅读全文
posted @ 2014-03-16 18:19
SangS
阅读(427)
评论(0)
推荐(0)

浙公网安备 33010602011771号