摘要：
1.dijkstra 2.flody 个人建议如果在能用dijkstra的地方就尽量用，flody一般会超时。当然如果遇负环的情况的时候就需要用spfa的算法了。 阅读全文
摘要：
题目链接： http://acm.split.hdu.edu.cn/showproblem.php?pid=3661 Problem Description In a factory, there are N workers to finish two types of tasks (A and B 阅读全文
摘要：
题目链接： http://acm.split.hdu.edu.cn/showproblem.php?pid=3665 Problem Description XiaoY is living in a big city, there are N towns in it and some towns n 阅读全文