NYOJ T1248 海岛争霸

                                   NYOJ T1248 海岛争霸

---

题目思路：

   其实这道题跟POJ T2253 Frogger 恰恰相反，首先你要先求得每条不同路径的最大危险程度（注意，并不是每条路径危险程度的和），然后再比较所有路径，取其最小的危险程度（即题意）......

 

Dijkstra写法

#include<cstdio>
#include<algorithm>
#define INF 0x3f3f3f3f
#define maxn 105
using namespace std;

bool vis[maxn];
int map[maxn][maxn],dis[maxn],n,m;

void Init(){
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= i; j++)
		    i == j ? map[i][j] = 0 : map[i][j] = map[j][i] = INF;
	}
}

int Dijkstra(int u,int v)
{
    for(int i = 1; i <= n; i++){
    	dis[i] = map[u][i];
    	vis[i] = false;
    }
    vis[u] = true;
	for(int i = 1; i <= n; i++){
		int minn = INF,p = 0;
		for(int j = 1; j <= n; j++){
			if(!vis[j] && dis[j] < minn){
			    minn = dis[j];
			    p = j;
		    }
		}
		if(minn == INF) break;
		vis[p] = true;
		for(int j = 1; j<= n; j++){
			if(!vis[j])
			    dis[j] = min(dis[j],max(dis[p],map[p][j]));  //先求得每条不同路径的最大危险程度，再比较所有路径，取其最小的危险程度（即题意）。
		}
	} 
	if(dis[v] >= INF) return -1;
	else return dis[v];
}

int main(){
	int u,v,w,q;
    while(~scanf("%d%d",&n,&m)){
    	Init();
    	for(int i=0; i<m; i++){
    		scanf("%d%d%d",&u,&v,&w);
    		map[u][v] = map[v][u] = min(map[u][v],w);
    	}
    	scanf("%d",&q);
    	while(q--){
    		scanf("%d%d",&u,&v);
    		printf("%d\n",Dijkstra(u,v));
    	}
    }
	return 0;
}

---

Floyd写法

因为N的范围比较小，所以可以用Floyd来写

#include<cstdio>
#include<algorithm>
#define INF 0x3f3f3f3f
#define maxn 505
using namespace std;
int map[maxn][maxn],n,m;

void Init(){
	for(int i = 0; i <= n; i++)
	    for(int j = 0; j <= n ;j++){
	    	if(i == j) map[i][j] = 0; //floydËã·¨£¬Òª½«¶Ô½ÇÏß³õʼ»¯Îª0£¡£¡£¡£¡ 
	    	else map[i][j] = INF;     //Àý£ºk==1£¬i=j==3; 
	    }
} 

void Floyd(){
	for(int k = 1; k <= n; k++)
	    for(int i = 1; i <= n; i++)
	        for(int j = 1; j <= n; j++)
	        {
	        	if(map[i][k]!=INF && map[k][j]!=INF)
	        	    map[i][j] = min(map[i][j],max(map[k][j],map[i][k]));
	        }
}

int main(){
	int a,b,c,q;
	while(~scanf("%d%d",&n,&m)){
		Init();
		for(int i = 0; i < m ; i++){
			scanf("%d%d%d",&a,&b,&c);
			map[a][b] = map[b][a] = min(map[a][b],c);
		}
		Floyd();
		scanf("%d",&q);
		for(int i = 0; i < q; i++){
			scanf("%d%d",&a,&b);
			map[a][b] == INF ? printf("-1\n") : printf("%d\n",map[a][b]);
		}
	}
	return 0;
}