poj 1797 Heavy Transportation
2011-08-06 20:07
369 查看
#include <iostream> #include <stdio.h> #include <queue> #define N 1005 using namespace std; int a ; int n; int d ; bool f ; void dij(){ int i,j; memset(f,0,sizeof(f)); for(i=1;i<=n;i++){ d[i]=a[1][i]; } f[1]=1; for(i=1;i<n;i++){ int max=-1; int u; for(j=1;j<=n;j++){ if(!f[j]&&d[j]>max){ max=d[j]; u=j; } } f[u]=1; for(j=1;j<=n;j++){ if(!f[j]){ if(a[u][j]>=max) d[j]=max; if(a[u][j]<max){ if(a[u][j]>d[j]) d[j]=a[u][j]; } } } } } int main(){ int t; cin>>t; int i; for(i=1;i<=t;i++){ memset(d,0,sizeof(d)); cin>>n; memset(a,0,sizeof(a)); int m; cin>>m; while(m--){ int st1,st2,w; cin>>st1>>st2>>w; a[st1][st2]=w; a[st2][st1]=w; } dij(); printf("Scenario #%d:\n",i); printf("%d\n\n",d ); } return 0; }
相关文章推荐
- Poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation(最短路变种2,连通图的最小边)
- poj1797 Heavy Transportation kruskal+并查集
- POJ - 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 kruskal 算法
- POJ 1797 Heavy Transportation
- poj-1797-Heavy Transportation [最短路][Dijkstra]
- POJ 1797 Heavy Transportation(最大生成树-Prim)
- poj 1797
- POJ1797 Heavy Transportation
- POJ 1797
- POJ 1797 Heavy Transportation(Dijkstra的稍加变形,三角形3边关系)
- poj 1797 Heavy Transportation(通路中的最大承载量)
- POJ 1797 - Heavy Transportation
- POJ - 1797 Heavy Transportation(dijkstra)
- POJ 1797 Heavy Transportation 最短路变形
- POJ - 1797 Heavy Transportation