图论-最短路问题
文章平均质量分 88
twobqn123
这个作者很懒,什么都没留下…
展开
-
poj2240(Floyd最短路的变种---最长路 )Arbitrage
Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12761 Accepted: 5392 Description Arbitrage is the use of discrepancies in currency exchange rates t原创 2013-07-19 17:15:00 · 641 阅读 · 0 评论 -
poj1062 昂贵的聘礼(Dijkstra+枚举等级处理)
昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 33464 Accepted: 9533 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探原创 2013-12-10 13:45:53 · 557 阅读 · 0 评论 -
poj 1847(floyd) Tram
Tram Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8548 Accepted: 3093 Description Tram network in Zagreb consists of a number of intersections and rails c原创 2013-07-19 02:23:54 · 641 阅读 · 0 评论 -
poj 1797 Heavy Transportation
Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 18592 Accepted: 4915 Description Background Hugo Heavy is happy. After the breakdown of原创 2013-12-12 09:56:17 · 457 阅读 · 0 评论 -
poj1860 Currency Exchange(货币交换,最短路问题)
Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17436 Accepted: 6112 Description Several currency exchange points are working in our city.原创 2013-12-13 00:16:30 · 738 阅读 · 0 评论 -
poj1502MPI Maelstrom(Dijkstra等等最短路的入门题)
MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4663 Accepted: 2831 Description BIT has recently taken delivery of their new supercomputer, a 3原创 2013-12-28 16:13:55 · 590 阅读 · 0 评论 -
poj1529Shipping Routes(floyd)
其中leg理解为路(双向)即可。翻译链接 描述: The Slow Boat to China Shipping company needs a program to help them quickly quote costs to prospective customers. 某船需要给客户预期报价。 The cost of a shipment depends on the size of原创 2013-12-28 17:16:36 · 716 阅读 · 0 评论 -
ZOJ 3675 Trim the Nails(bfs+状态压缩搜索)
Trim the Nails Time Limit: 2 Seconds Memory Limit: 65536 KB Robert is clipping his fingernails. But the nail clipper is old and the edge of the nail clipper is potholed. The nail clippe原创 2013-12-21 15:31:58 · 574 阅读 · 0 评论 -
poj 1130 Alien Security (dfs+bfs<反向最短路>)
Alien Security Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2646 Accepted: 974 Description You are in charge of security at a top-secret government resear原创 2013-12-23 21:22:47 · 815 阅读 · 0 评论 -
poj1178 Camelot(floyd+枚举)
Camelot Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2558 Accepted: 1190 Description Centuries ago, King Arthur and the Knights of the Round Table used to原创 2013-12-11 08:33:18 · 625 阅读 · 0 评论 -
poj1125 POJ 1125 Stockbroker Grapevine(两种方法Dijkstra或者floyd)
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24440 Accepted: 13443 Description Stockbrokers are known to overreact to rumours. You h原创 2013-12-10 18:43:23 · 694 阅读 · 0 评论 -
Floyd 算法原理
[转] Floyd 算法原理 floyd算法是一个经典的动态规划算法。用通俗的语言来描述的话,首先我们的目标是寻找从点i到点j的最短路径。从动态规划的角度看问题,我们需要为这个目标重新做一个诠释(这个诠释正是动态规划最富创造力的精华所在),floyd算法加入了这个概念 Ak(i,j):表示从i到j中途不经过索引比k大的点的最短路径。 这个限制的重要之处在于,它将最转载 2013-07-19 16:03:40 · 1231 阅读 · 0 评论 -
POJ3159 差分约束系统
Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 20396 Accepted: 5404 Description During the kindergarten days, flymouse was the monitor of his cla原创 2013-07-20 14:38:07 · 577 阅读 · 0 评论 -
很棒一个差分约束系统的理解,希望对你有帮助,果断转了
差分约束系统(System Of Difference Constraints) (本文假设读者已经有以下知识:最短路径的基本性质、Bellman-Ford算法。) 比如有这样一组不等式: X1 - X2 X1 - X5 X2 - X5 X3 - X1 X4 - X1 X4 - X3 X5 - X3 X5 - X4转载 2013-07-20 00:54:11 · 632 阅读 · 0 评论 -
Dijkatra+Head_poj3268
Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10312 Accepted: 4574 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2013-07-21 13:53:35 · 685 阅读 · 0 评论 -
poj2983(差分约束系统)Is the Information Reliable?
Is the Information Reliable? Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 9855 Accepted: 3061 Description The galaxy war between the Empire Draco and t原创 2013-07-21 00:03:45 · 690 阅读 · 0 评论 -
hdu 4707(最短路) Pet
Pet Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 303 Accepted Submission(s): 117 Problem Description One day, Lin Ji wake up in t原创 2013-09-08 22:29:10 · 629 阅读 · 0 评论 -
poj3083 非常好 的入门级dfs+bfs
poj3083 Children of the Candy Corn Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8505 Accepted: 3728 Description The cornfield maze is a popular Halloween原创 2013-11-30 22:26:02 · 839 阅读 · 0 评论 -
poj2225Asteroids!(三维BFS)
Asteroids! Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2875 Accepted: 1090 Description You're in space. You want to get home. There are asteroids. You原创 2013-12-03 23:02:18 · 995 阅读 · 0 评论 -
poj 1237(欧拉回路+floyd)
The Postal Worker Rings Once Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 674 Accepted: 427 Description Graph algorithms form a very important part of com原创 2013-12-24 17:30:02 · 914 阅读 · 0 评论