UVA 10099 The Tourist Guide
2014-11-10 22:46
363 查看
直接找路径中最小值的最大值,最小的最大这个概念好好理解下就行了
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #define INF 1e10 using namespace std; const int N=1000; int dis ; int main() { int m,n; int counter=0; while(~scanf("%d%d",&m,&n) &&(m!=0 || n!=0)){ counter++; int s,t,num; for(int i=1;i<=m;i++){ for(int j=1;j<=m;j++){ if(i!=j){ dis[i][j]=0; } } } int ss,tt,ren; for(int i=1;i<=n;i++){ scanf("%d%d%d",&s,&t,&num); dis[s][t]=num; dis[t][s]=num; } scanf("%d%d%d",&ss,&tt,&ren); for(int k=1;k<=m;k++){ for(int i=1;i<=m;i++){ for(int j=1;j<=m;j++){ if(i!=j){ if(dis[i][j]<min(dis[i][k],dis[k][j])){ dis[i][j]=min(dis[i][k],dis[k][j]); } } } } } int ans=ren/(dis[ss][tt]-1); if(ren%(dis[ss][tt]-1)!=0)ans++; printf("Scenario #%d\nMinimum Number of Trips = %d\n\n",counter,ans); } return 0; } /* 7 10 1 2 30 1 3 15 1 4 10 2 4 25 2 5 60 3 4 40 3 6 20 4 7 35 5 7 20 6 7 30 1 7 99 2 1 1 2 50 2 1 50 0 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 (floyd+dp)
- The Tourist Guide - UVa 10099 Floyd
- uva 10099 The Tourist Guide(单源最短路/spfa/dijkstra)
- UVa10099_The Tourist Guide(最短路/floyd)(小白书图论专题)
- UVA 10099 The Tourist Guide
- UVa - 10099 The Tourist Guide 并查集+贪心
- UVa10099-The Tourist Guide
- UVa Prolbem 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
- UVa10099_The Tourist Guide(最短路/floyd)(小白书图论专题)
- UVa 10099 The Tourist Guide (最大生成树+最小边的最大化+Kruskal)