![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
---最短路&&差分约束
wikioi_bai
时间并不会因为你的迷茫和迟疑而停留,就在你看这篇文章的同时,不知道有多少人在冥思苦想,在为算法废寝忘食,不知道有多少人在狂热地拍着代码,不知道又有多少提交一遍又一遍地刷新着OJ的status页面……
没有谁生来就是神牛,而千里之行,始于足下!
展开
-
POJ 2387 Til the Cows Come Home(Dijkstra判重边)
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31748 Accepted: 10757DescriptionBessie is out in the field and wants to get back原创 2015-02-24 12:06:38 · 2491 阅读 · 0 评论 -
Bellman-Ford------解决负权边
这几天一直在搞最短路专题,快开学了,希望能搞定这块和并查集,开学就弄数据结构和数学了。其实Bellman-Ford算法是在于解决Dijkstra算法算不能解决的带有负权边的情况下产生的,其实Bellman-Ford算法相当的简单,核心代码只有4行的样子,但是真正理解这4行代码其实也是不难的。。。。for ( int k = 1;k <= n-1;k++ ){ for ( int i =原创 2015-02-27 21:51:01 · 1243 阅读 · 0 评论 -
HDU 2544 最短路( Dijkstra模板题/SPFA初学)
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36086 Accepted Submission(s): 15700Problem Description在每年的校赛里,所有进入决赛的同学都会获原创 2015-02-27 22:50:28 · 557 阅读 · 0 评论 -
POJ 1797 Heavy Transportation(Dijkstra的稍加变形,三角形3边关系)
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 21632 Accepted: 5754DescriptionBackground Hugo Heavy is happy. After the breakdo原创 2015-02-27 11:58:26 · 493 阅读 · 0 评论 -
POJ 3268 Silver Cow Party(两次Dijkstra求最大值)
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13489 Accepted: 6075DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) convenientl原创 2015-02-27 13:05:01 · 496 阅读 · 0 评论