随笔分类 -  ACM_图论

1 2 下一页
UvA 12661 Funny Car Racing (最短路)
摘要：There is a funny car racing in a city with n junctions and m directed roads.The funny part is: each road is open and closed periodically. Each road is 阅读全文
posted @ 2015-08-18 17:02 Cliff Chen 阅读(204) 评论(0) 推荐(0)
POJ Borg Maze (BFS+最小生成树)
摘要：Borg Maze Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10428 Accepted: 3463 Description The Borg is an immensely powerful race of enhanc 阅读全文
posted @ 2015-08-07 00:47 Cliff Chen 阅读(193) 评论(0) 推荐(0)
POJ 2349 Arctic Network (最小生成树第K大（小）边)
摘要：Arctic Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13108 Accepted: 4256 Description The Department of National Defence (DND) wi 阅读全文
posted @ 2015-08-06 22:29 Cliff Chen 阅读(222) 评论(0) 推荐(0)
POJ 1258 Agri-Net (prim)
摘要：Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 45047 Accepted: 18477 Description Farmer John has been elected mayor of his town! 阅读全文
posted @ 2015-08-05 23:37 Cliff Chen 阅读(157) 评论(0) 推荐(0)
HDU 4370 0 or 1(最短路+最小环判断)
摘要：0 or 1Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1421Accepted Submission(s): 388Problem Descr... 阅读全文
posted @ 2015-07-28 21:06 Cliff Chen 阅读(223) 评论(0) 推荐(0)
关于最短路的几个算法
摘要：关于最短路的几个算法有Dijkstra，Bellman-Ford，Floyd Dijkstra： Dijkstra适用于边权为正的情况，从单个源点出发，到其他所有结点的最短路 算法的核心是用已经知道的结点 i 的距离 d[i] 去更新和这个结点相连的其他结点的距离 其核心思想还是没有变，依旧是用已经 阅读全文
posted @ 2015-07-27 22:19 Cliff Chen 阅读(376) 评论(0) 推荐(0)
POJ 2502 Subway(最短路)
摘要：Subway Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6979 Accepted: 2287 Description You have just moved from a quiet Waterloo neighbourh 阅读全文
posted @ 2015-07-27 15:38 Cliff Chen 阅读(193) 评论(0) 推荐(0)
POJ 1860 Currency Exchange (Bellman ford)
摘要：Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22405 Accepted: 8095 Description Several currency exchange points are wor 阅读全文
posted @ 2015-07-25 23:41 Cliff Chen 阅读(158) 评论(0) 推荐(0)
POJ 1502 MPI Maelstrom (最短路)
摘要：MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6329 Accepted: 3925 Description BIT has recently taken delivery of their new 阅读全文
posted @ 2015-07-25 22:57 Cliff Chen 阅读(123) 评论(0) 推荐(0)
CSU 1541There is No Alternative (最小生成树判相同边)
摘要：1541: There is No Alternative Description Input Output Sample Input Sample Output HINT Source 题目的意思就是建造桥，问在建造桥的最小花费的方案中，有哪些桥是必须要建的 把桥连接起来然后求最小造价是最小生成树 阅读全文
posted @ 2015-03-26 16:01 Cliff Chen 阅读(313) 评论(0) 推荐(0)
HDU 2680 Choose the best route (最短路)
摘要：Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7361 Accepted Submission(s) 阅读全文
posted @ 2014-10-19 14:47 Cliff Chen 阅读(184) 评论(0) 推荐(0)
HDU 1285 确定比赛名次 (预处理+拓扑排序)
摘要：确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12842 Accepted Submission(s): 5163 Problem 阅读全文
posted @ 2014-10-17 23:16 Cliff Chen 阅读(173) 评论(0) 推荐(0)
CSU 1312 CX and girls (最短路)
摘要：1321: CX and girls Description CX是要赶去上课，为了不迟到必须要以最短的路径到达教室，同时CX希望经过的路上能看到的学妹越多越好。现在把地图抽象成一个无向图，CX从1点出发，教室在N号点，告诉每个点上学妹的数量，每条边的长度。请你求出CX以最短路径赶到教室最多能看到多 阅读全文
posted @ 2014-09-07 11:21 Cliff Chen 阅读(186) 评论(0) 推荐(0)
POJ 1797 Heavy Transportation (最短路变形)
摘要：Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 20364 Accepted: 5401 Description Background Hugo Heavy is happy. After 阅读全文
posted @ 2014-08-19 10:07 Cliff Chen 阅读(182) 评论(0) 推荐(0)
HDU 1598 find the most comfortable road (并查集||最短路)
摘要：find the most comfortable road Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3720 Accepted Subm 阅读全文
posted @ 2014-08-12 10:11 Cliff Chen 阅读(146) 评论(0) 推荐(0)
HDU 3832 Earth Hour (最短路)
摘要：Earth Hour Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1518 Accepted Submission(s): 607 Prob 阅读全文
posted @ 2014-08-11 21:29 Cliff Chen 阅读(209) 评论(0) 推荐(0)
HDU 2544 最短路 (最短路)
摘要：最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31955 Accepted Submission(s): 13845 Problem D 阅读全文
posted @ 2014-08-11 16:23 Cliff Chen 阅读(150) 评论(0) 推荐(0)
HDU 1874 畅通工程续 (最短路)
摘要：畅通工程续 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28050 Accepted Submission(s): 10157 Problem 阅读全文
posted @ 2014-08-11 16:11 Cliff Chen 阅读(235) 评论(0) 推荐(0)
HDU 1879 继续畅通工程 (最小生成树)
摘要：继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13765 Accepted Submission(s): 5992 Problem 阅读全文
posted @ 2014-08-11 09:43 Cliff Chen 阅读(158) 评论(0) 推荐(0)
HDU 1875 畅通工程再续 (最小生成树)
摘要：畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14835 Accepted Submission(s): 4591 Problem 阅读全文
posted @ 2014-08-10 17:58 Cliff Chen 阅读(185) 评论(0) 推荐(0)

1 2 下一页