最短路
关注
分享
扫一扫
文章平均质量分 81
974792789
不要在能吃苦的年纪追求安逸。
展开
-
Dijkstra?+spfa+路径的记录
C. Dijkstra?time limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputYou are given a weighted undirected graph. The原创 2014-08-02 16:42:14 · 605 阅读 · 0 评论 -
City Tour+SPOJ+二分+spfa
City TourTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 552 Solved: 126[Submit][Status][Web Board]DescriptionAlice想要从城市A出发到城市B,由于Alice最近比较穷(不像集训队陈兴老师是个rich second)，所以只能选择做火车从A到B。不过Ali原创 2014-08-15 19:14:34 · 470 阅读 · 0 评论 -
Candies+差分约束+spfa+poj
CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 22570 Accepted: 6065DescriptionDuring the kindergarten days, flymouse was the monitor of his c原创 2014-07-30 23:56:54 · 471 阅读 · 0 评论 -
天朝的单行道+csuoj+spfa算法求最短路
1256: 天朝的单行道Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 168 Solved: 49Description 在另一个平行宇宙中，有一个神奇的国度名叫天朝。天朝一共有N个城市（标号分别为1, 2, …, N），M条道路，为了方便交通管制，天朝的M条道路都是单行道。 不久前天朝大选，小Q当选原创 2014-07-31 14:00:03 · 654 阅读 · 0 评论 -
ROADS+dijkstra的灵活运用+POJ
dijkstra算法的变形，用上优先队列+bfs求在花费限制的条件下的最短路。原创 2014-07-31 13:48:39 · 2287 阅读 · 2 评论 -
Going in Cycle!!+二分答案+spfa判负环+裸题+uva
Going in Cycle!!Input: standard inputOutput: standard output You are given a weighted directed graph with n vertices and m edges. Each cycle in the graph has a weight,原创 2014-07-30 13:05:49 · 709 阅读 · 0 评论 -
Intervals+POJ+差分约束
IntervalsTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uDescriptionYou are given n closed, integer intervals [ai, bi] and n integers c原创 2014-07-31 08:35:17 · 471 阅读 · 0 评论 -
最短路+hdu+spfa算法模板题
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31278 Accepted Submission(s): 13497Problem Description在每年的校赛里，所有进入决赛的同学都会获原创 2014-07-29 15:41:57 · 752 阅读 · 0 评论 -
Invitation Cards+POJ+有一道比较裸的最短路+spfa
Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 19013 Accepted: 6222DescriptionIn the age of television, not many people attend theater原创 2014-07-29 20:28:46 · 569 阅读 · 0 评论 -
畅通工程续+hdu+floyd算法实现
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27181 Accepted Submission(s): 9811Problem Description某省自从实行了很多年的畅通工程计划后，原创 2014-07-29 15:36:00 · 488 阅读 · 0 评论 -
最短路径问题+hdu+原始dijkstra+优先队列优化dijkstra+邻接矩阵的建立
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12493 Accepted Submission(s): 3786Problem Description给你n个点，m条无向边，每条边都有长原创 2014-07-29 15:37:44 · 565 阅读 · 0 评论 -
Greg and Graph+floyd算法的应用
Greg and Graphfloyd算法的理解与灵活运用+逆向思维原创 2014-08-02 16:47:30 · 859 阅读 · 0 评论 -
Codeforces Round #286 (Div. 2) B. Mr. Kitayuta's Colorful Graph +foyd算法的应用
B. Mr. Kitayuta's Colorful Graph求不同颜色路径的个数，Floyd算法的应用。原创 2015-01-22 10:11:57 · 813 阅读 · 0 评论