最短路径
deebcjrb
这个作者很懒,什么都没留下…
展开
-
【每日一题】8月6日题目精讲—追债之旅(spfa)
https://ac.nowcoder.com/acm/problem/14700给最短路的dist数组加一维,表示现在是第几天(已经进过了几条边)把最短路松弛操作改为:if (dist[x][k+1] > dist[y][k] + w[x][y]) dist[x][k+1] = dist[y][k] + w[x][y];即可。或者直接拆点——一个点拆成十个重新连边即可。#include<bits/stdc++.h>using namespace std;const in原创 2020-08-20 23:05:09 · 145 阅读 · 1 评论 -
HDU Today(hdu2112)(map+dijstra)
原题目:经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在什么地方下车(其实徐总自己有车,...原创 2019-11-18 14:28:18 · 62 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)Arbitrage
原题目:Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 ...原创 2019-09-16 18:03:47 · 104 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)Cow Contest
原题目:N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that...原创 2019-09-11 23:07:27 · 128 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)Currency Exchange (Floyd或者Bellman-Ford)
原题目:Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. The...原创 2019-09-10 23:41:02 · 247 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)MPI Maelstrom(dijstra模板题)
原题目:BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's researc...原创 2019-09-09 23:34:59 · 105 阅读 · 0 评论 -
Floyd算法简介
文章:https://blog.csdn.net/qq_34374664/article/details/52261597核心代码:#include <iostream>using namespace std;int main(){ int e[10][10],k,i,j,n,m,t1,t2,t3; int inf=99999999; //用inf(in...原创 2019-09-08 11:04:40 · 1729 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)Silver Cow Party
原题目:One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-...原创 2019-09-02 23:34:09 · 112 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)Heavy Transportation
原题目:BackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place hi...原创 2019-09-01 17:40:09 · 122 阅读 · 0 评论 -
(kuangbin带你飞--最短路径)Til the Cows Come Home POJ2387
原题目:Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to...原创 2019-07-25 09:52:41 · 93 阅读 · 0 评论