Uva 10099 - The Tourist Guide
2013-04-03 23:23
525 查看
2Y
Floyd简易变形
注意这个导游也要走
有效边权值减一,测试用例很和谐=.=
还有第一次忘记回车了=.=
Floyd简易变形
注意这个导游也要走
有效边权值减一,测试用例很和谐=.=
还有第一次忘记回车了=.=
#include<stdio.h> #define INF (int)1e9 int g[110][110]; int max(int a,int b){ if(a>b)return a;return b; } int min(int a,int b){ if(a>b)return b;return a; } int main(){ int n,m; int z=0; while(scanf("%d%d",&n,&m)!=EOF){ if(!n&&!m)break; int i,j,k; for(i=1;i<=n;i++)for(j=1;j<=n;j++)g[i][j]=INF; int x,y,v; for(i=1;i<=m;i++){ scanf("%d%d%d",&x,&y,&v); g[x][y]=v; g[y][x]=v; } for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){ if(g[i][k]!=INF&&g[k][j]!=INF){ int temp=min(g[i][k],g[k][j]); if(g[i][j]==INF)g[i][j]=temp; else g[i][j]=max(g[i][j],temp); } } /* for(i=1;i<=n;i++){ for(j=1;j<=n;j++)printf("%4d",g[i][j]); printf("\n"); }*/ scanf("%d%d%d",&x,&y,&v); printf("Scenario #%d\n",++z); int res=0; while(res*g[x][y]<v+res)res++; printf("Minimum Number of Trips = %d\n\n",res); } return 0; }
相关文章推荐
- uva 10099 The Tourist Guide(最“大”生成树)
- UVa 10099 The Tourist Guide
- UVa - 10099 The Tourist Guide 并查集+贪心
- uva 10099【The Tourist Guide】
- UVA - 10099 The Tourist Guide
- UVa 10099 The Tourist Guide
- uva 10099 - The Tourist Guide(最小生成树)
- UVA_10099_The Tourist Guide_kruscal
- UVA 10099 The Tourist Guide
- UVA 10099 - The Tourist Guide(floyd)
- UVA 10099 The Tourist Guide
- UVA 10099 The Tourist Guide
- UVA - 10099 The Tourist Guide (floyd+dp)
- The Tourist Guide - UVa 10099 Floyd
- UVa 10099 The Tourist Guide (最大生成树+最小边的最大化+Kruskal)
- UVa 10099 - The Tourist Guide
- UVA 10099 The Tourist Guide【floyd】
- UVa Prolbem 10099 The Tourist Guide (导游)
- UVa10099_The Tourist Guide(最短路/floyd)(小白书图论专题)
- uva 10099 The Tourist Guide(单源最短路/spfa/dijkstra)