标签：des   style   blog   http   color   os   io   strong   

解题报告

题意：

求所有路中最大分贝最小的路。

思路：

类似floyd算法的思想，u->v可以有另外一点k，通过u->k->v来走，拿u->k和k->v的最大值和u->v比较，存下最小的值。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define inf 0x3f3f3f3f
using namespace std;
int n,m,q,mmap[110][110];
void floyd() {
    for(int k=0; k<n; k++)
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                mmap[i][j]=min(mmap[i][j],max(mmap[i][k],mmap[k][j]));
}
int main() {
    int i,j,u,v,w,k=1;
    while(~scanf("%d%d%d",&n,&m,&q)) {
        if(!n&&!m&&!q)break;
        for(i=0; i<n; i++) {
            for(j=0; j<n; j++)
                mmap[i][j]=inf;
            mmap[i][i]=0;
        }
        for(i=0; i<m; i++) {
            scanf("%d%d%d",&u,&v,&w);
            mmap[u-1][v-1]=mmap[v-1][u-1]=w;
        }
        floyd();
        if(k!=1)
            printf("\n");
        printf("Case #%d\n",k++);
        while(q--) {
            scanf("%d%d",&u,&v);
            if(mmap[u-1][v-1]==inf)
                printf("no path\n");
            else
                printf("%d\n",mmap[u-1][v-1]);
        }
    }
    return 0;
}

Problem B: Audiophobia

However, for the time being, we will consider only one type of pollution -- the sound pollution. The loudness or intensity level of sound is usually measured in decibels and sound having intensity level 130 decibels or higher is considered painful. The intensity level of normal conversation is 60-65 decibels and that of heavy traffic is 70-80 decibels.

Consider the following city map where the edges refer to streets and the nodes refer to crossings. The integer on each edge is the average intensity level of sound (in decibels) in the corresponding street.

To get from crossing A to crossing G you may follow the following path: A-C-F-G. In that case you must be capable of tolerating sound intensity as high as 140 decibels. For the paths A-B-E-G, A-B-D-G and A-C-F-D-G you must tolerate respectively 90, 120 and 80 decibels of sound intensity. There are other paths, too. However, it is clear that A-C-F-D-G is the most comfortable path since it does not demand you to tolerate more than 80 decibels.

In this problem, given a city map you are required to determine the minimum sound intensity level you must be able to tolerate in order to get from a given crossing to another.

Input 

The input may contain multiple test cases.

The first line of each test case contains three integers ,  and  where Cindicates the number of crossings (crossings are numbered using distinct integers ranging from 1 to C), Srepresents the number of streets and Q is the number of queries.

Each of the next S lines contains three integers: c₁, c₂ and d indicating that the average sound intensity level on the street connecting the crossings c₁ and c₂ ( ) is d decibels.

Each of the next Q lines contains two integers c₁ and c₂ ( ) asking for the minimum sound intensity level you must be able to tolerate in order to get from crossing c₁ to crossing c₂.

The input will terminate with three zeros form C, S and Q.

Output 

For each test case in the input first output the test case number (starting from 1) as shown in the sample output. Then for each query in the input print a line giving the minimum sound intensity level (in decibels) you must be able to tolerate in order to get from the first to the second crossing in the query. If there exists no path between them just print the line ``no path".

Print a blank line between two consecutive test cases.

Sample Input 

7 9 3
1 2 50
1 3 60
2 4 120
2 5 90
3 6 50
4 6 80
4 7 70
5 7 40
6 7 140
1 7
2 6
6 2
7 6 3
1 2 50
1 3 60
2 4 120
3 6 50
4 6 80
5 7 40
7 5
1 7
2 4
0 0 0

Sample Output 

Case #1
80
60
60
 
Case #2
40
no path
80

UVa10048_Audiophobia(最短路/floyd)(小白书图论专题),布布扣,bubuko.com

UVa10048_Audiophobia(最短路/floyd)(小白书图论专题)

标签：des   style   blog   http   color   os   io   strong   

原文地址：http://blog.csdn.net/juncoder/article/details/38742377