poj 1797 Heavy Transportation

来源：互联网发布：淘宝油烟净化器编辑：程序博客网时间：2024/04/30 08:39

最短路ing~

前三道大水题。。。

慢慢来吧。

#include<cstdio>#include<algorithm>#include<cstring>#include<iostream>using namespace std;const int inf = 0x3f3f3f3f;const int Max = 1005;int dict[Max],edge[Max][Max],n,m;bool vis[Max];int minn(int x,int y) {    if(x < y)        return x;    else         return y;}void dijkstra() {    int maxx,now = 1,k;    for(int s = 1;s <= n;s++) {         maxx = 0;        for(int i = 2;i <= n;i++) {            if(!vis[i]) {                if(edge[now][i] != 0 && dict[i] < edge[now][i])                     dict[i] = edge[now][i];                if(maxx < dict[i])                    maxx = dict[k = i];            }        }        vis[k] = true;        if(k == n)            break;        now = k;    }    int ans = inf;    for(int j = 2;j <= n;j++)        if(vis[j])            ans = minn(ans,dict[j]);    printf("%d\n\n",ans);}int main() {    int tt;    scanf("%d",&tt);    for(int t = 1;t <= tt;t++) {        scanf("%d%d",&n,&m);        memset(edge,0,sizeof(edge));        memset(dict,0,sizeof(dict));        memset(vis,false,sizeof(vis));        vis[1] = true;dict[1] = 0;        for(int i = 1;i <= m;i++) {            int x,y,value;            scanf("%d%d%d",&x,&y,&value);            if(edge[x][y] == 0 || edge[x][y] < value) {                edge[x][y] = value;                edge[y][x] = value;            }        }        printf("Scenario #%d:\n",t);        dijkstra();    }}

0 0