最短路
Ha_chuochuo
这个作者很懒,什么都没留下…
展开
-
昂贵的聘礼 POJ - 1062 (最短路专题)
题目描述 会长东东想娶酋长的女儿,但酋长要求他给一定数额金钱的聘礼。除了金钱外,酋长也允许用部落里其他人的某物品加上一点钱作为聘礼。而其他人的物品也可以通过指定的另外一些人的某物品加上一些金钱获得。但是部落里的每个人有一个等级。整个交易过程涉及的人的等级只能在一个限定的差值内。问会长东东最少需要多少金钱才能娶到酋长女儿。假定每个人只有一个物品。 Input 输入第一行是两个整数M,N(1 <= N <= 100),依次表示地位等级差距限制和物品的总数。接下来按照编号从小到大依次给出了N个原创 2020-07-30 22:51:58 · 278 阅读 · 0 评论 -
Cow Contest POJ 3660 (Floyed ) (最短路专题)
题目描述 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 is unique among the competitors. The contest is condu...原创 2020-07-30 21:24:54 · 140 阅读 · 0 评论 -
0 or 1 HDU - 4370 (spfa) 最短路专题
题目描述 Given a n*n matrix Cij(1<=i,j<=n),We want to find a n*n matrix Xij(1<=i,j<=n),which is 0 or 1. Besides,Xijmeets the following conditions: 1.X12+X13+...X1n=1 2.X1n+X2n+...Xn-1n=1 3.for each i (1<i<n), satisfies ∑Xki(1<=k<=...原创 2020-07-28 00:19:34 · 165 阅读 · 0 评论 -
The Shortest Path in Nya Graph HDU - 4725 分层最短路 Dijkstra(最短路专题)
题目描述 Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae is in city A and girls are in city B. Every time starvae can get to city B and make a data with a girl he likes. B原创 2020-07-27 22:23:23 · 103 阅读 · 0 评论 -
Candies (POJ3159) 线性约束差分+堆优化Dijkstra 最短路专题
题目描述 During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids loved candies very much and often compared原创 2020-07-26 00:03:43 · 119 阅读 · 0 评论 -
Wormholes (POJ 3259)(判断负圈)(spfa) 最短路专题
题目描述 While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's .原创 2020-07-24 20:27:48 · 129 阅读 · 0 评论 -
Currency Exchange (POJ1860)(判断正圈)(spfa) 最短路专题
题目描述 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. There can be several points specializing in the same pair原创 2020-07-24 19:10:24 · 247 阅读 · 0 评论