UVa10099_The Tourist Guide(最短路/floyd)(小白書圖論專題)

UVa10099_The Tourist Guide(最短路/floyd)(小白書圖論專題)

解題報告

題意：

有一個旅游團現在去出游玩，現在有n個城市，m條路。由於每一條路上面規定了最多能夠通過的人數，現在想問這個旅游團人數已知的情況下最少需要運送幾趟

思路：

求出發點到終點所有路當中最小值最大的那一條路。

求發可能有多種，最短路的松弛方式改掉是一種，最小生成樹的解法也是一種（ps，prime和dijs就是這樣子類似的）

#include 
#include 
#include 
#include 
#define inf 0x3f3f3f3f
using namespace std;
int n,m,q,mmap[110][110];
void floyd() {
    for(int k=0; k


The Tourist Guide
Input: standard input
Output: standard output
 
Mr. G. works as a tourist guide. His current assignment is to take some tourists from one city to another. Some two-way roads connect the cities. For each pair of neighboring cities there is a bus service that runs only between those two cities and uses
 the road that directly connects them. Each bus service has a limit on the maximum number of passengers it can carry. Mr. G. has a map showing the cities and the roads connecting them. He also has the information regarding each bus service. He understands that
 it may not always be possible for him to take all the tourists to the destination city in a single trip. For example, consider the following road map of 7 cities. The edges connecting the cities represent the roads and the number written on each edge indicates
 the passenger limit of the bus service that runs on that road.
 
                           
Now, if he wants to take 99 tourists from city 1 to city 7, he will require at least 5 trips, since he has to ride the bus with each group, and the route he should take is : 1 - 2 - 4 - 7.
But, Mr. G. finds it difficult to find the best route all by himself so that he may be able to take all the tourists to the destination city in minimum number of trips. So, he seeks your help.
 
Input
The input will contain one or more test cases. The first line of each test case will contain two integers: N (N<= 100) and R representing respectively the number of cities and the number of road segments. Then R lines will follow
 each containing three integers: C1, C2 andP. C1 and C2 are
 the city numbers and P (P> 1) is the limit on the maximum number of passengers to be carried by the bus service between the two cities. City numbers are positive integers ranging from 1 to N. The (R + 1)-th line will contain three
 integers: S, D andT representing respectively the starting city, the destination city and the number of tourists to be guided.
The input will end with two zeroes for N and R.
 
Output
For each test case in the input first output the scenario number. Then output the minimum number of trips required for this case on a separate line. Print a blank line after the output of each test case.
 
Sample Input
7 10

1 2 30

1 3 15

1 4 10

2 4 25

2 5 60

3 4 40

3 6 20

4 7 35

5 7 20

6 7 30

1 7 99

0 0




Sample Output
Scenario #1

Minimum Number of Trips = 5