ACM_搜索_最短路
文章平均质量分 79
三茶先生
life is so long,bu needs you to face~
展开
-
最短路
最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53518 Accepted Submission(s): 23526Problem Description 在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-sh原创 2016-07-19 14:40:14 · 198 阅读 · 0 评论 -
poj3259Wormholes(bellman_ford判断负环)
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 52526 Accepted: 19557 DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormh原创 2017-07-25 21:14:29 · 249 阅读 · 0 评论 -
poj1860Currency Exchange(spfa)
Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 30425 Accepted: 11502 DescriptionSeveral currency exchange points are working in our city. Let us suppose tha原创 2017-07-15 21:31:56 · 345 阅读 · 0 评论 -
poj 1178 Camelot(floyed+动规)
CamelotTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 1 Accepted Submission(s) : 1 Problem Description Centuries ago, King Arthur and the Kn原创 2017-04-20 19:03:37 · 258 阅读 · 0 评论 -
poj 1125 Stockbroker Grapevine
Stockbroker GrapevineTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 1 Accepted Submission(s) : 1 Problem Description Stockbrokers are known原创 2017-04-16 15:53:44 · 324 阅读 · 0 评论 -
HDU1535Invitation Cards
Invitation CardsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3641 Accepted Submission(s): 1704Problem DescriptionIn the age o原创 2016-08-25 16:38:25 · 338 阅读 · 0 评论 -
hdu2544最短路
转自 http://www.tuicool.com/articles/emeMF3最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28761 Accepted Submission(s): 12444转载 2016-08-25 11:22:18 · 166 阅读 · 0 评论 -
POJ1502 MPI Maelstrom
MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8526 Accepted: 5264 DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Ody原创 2016-08-24 16:43:07 · 169 阅读 · 0 评论 -
差分约束系统
一直不知道差分约束是什么类型题目,最近在写最短路问题就顺带看了下,原来就是给出一些形如x-y好神奇的是这类问题竟然可以转换成图论里的最短路径问题,下面开始详细介绍下比如给出三个不等式,b-a由题我们可以得知,这个有向图中,由题b-a根据以上的解法,我们可能会猜到求解过程实际就是求从a到c的最短路径,没错的....简单的说就是从a到c沿着某条路径后把所有权值和k求出就是c -a推广的不等式约束,转载 2016-08-24 15:16:49 · 154 阅读 · 0 评论 -
差分约束系统
一直不知道差分约束是什么类型题目,最近在写最短路问题就顺带看了下,原来就是给出一些形如x-y<=b不等式的约束,问你是否满足有解的问题好神奇的是这类问题竟然可以转换成图论里的最短路径问题,下面开始详细介绍下比如给出三个不等式,b-a<=k1,c-b<=k2,c-a<=k3,求出c-a的最大值,我们可以把a,b,c转换成三个点,k1,k2,k3是边上的权,如图由题我们可以得知,这个有向图中,由题b-a转载 2016-08-24 15:15:45 · 177 阅读 · 0 评论 -
A Walk Through the Forest
A Walk Through the Forest Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 7 Accepted Submission(s) : 4 Font: Times New Roman | Verdana | Geo原创 2016-07-11 22:16:57 · 214 阅读 · 0 评论 -
Collect More Jewels
Collect More Jewels Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 19 Accepted Submission(s) : 6 Font: Times New Roman | Verdana | Georgia原创 2016-07-13 17:37:21 · 787 阅读 · 0 评论 -
昂贵的聘礼(dijkstra)
昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 49861 Accepted: 14935 Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低原创 2017-07-27 19:53:58 · 206 阅读 · 0 评论