poj 2253

floyd变形算法
设置D[i][j] = 从i到j的所有路径li,对于每条路径的每个边的权重w的最大值为liw,则D[i][j]为所有i到j的路径的liw最小的那条的liw值

测试数据：
lstar@ubuntu:~/ds/poj$ ./test_list.sh 2253
2253_1.in.dat:
2
0 0
3 4


3
17 4
19 4
18 5


0
result:


Scenario #1
Frog Distance = 5.000


Scenario #2
Frog Distance = 1.414


2253_2.in.dat:
2
0 0
3 4


3
17 4
19 4
18 5


8
1 1
4 0
1 2
2 2
3 2
4 2
3 0
5 1


3
9 10
10 10
100 10


6
5 5
100 100
4 4
3 3
2 2
1 1
5
1 2
2 1
3 2
4 1
5 2


3
999 999
1 1
3 3


0
result:


Scenario #1
Frog Distance = 5.000


Scenario #2
Frog Distance = 1.414


Scenario #3
Frog Distance = 1.414


Scenario #4
Frog Distance = 1.000


Scenario #5
Frog Distance = 134.350


Scenario #6
Frog Distance = 1.414


Scenario #7
Frog Distance = 1408.557

code：

点击(此处)折叠或打开

1. #include <iostream>
   
2. #include <stdio.h>
   
3. #include <cmath>
   
4. #include <cstring>
   
5. 
   
6. using namespace std;
   
7. #define inf (10000.0)
   
8. 
   
9. int n;
   
10. #define MAX_V (200+1)
    
11. struct _v{
    
12.     int x;
    
13.     int y;
    
14. }V[MAX_V];
    
15. 
    
16. double E[MAX_V][MAX_V];
    
17. double D[MAX_V][MAX_V];
    
18. double dist[MAX_V];
    
19. int visit[MAX_V];
    
20. 
    
21. double dis(int x1,int y1,int x2,int y2)
    
22. {
    
23.     return sqrt( (double)( (x2-x1)*(x2-x1)+ (y2-y1)*(y2 - y1)));
    
24. }
    
25. 
    
26. double floyd()
    
27. {
    
28. 
    
29.     
    
30.     for(int k=1;k<=n;++k)
    
31.     {
    
32.         for(int i=1;i<=n;i++)
    
33.         {
    
34.             for(int j=1;j<=n;j++)
    
35.             {
    
36.                 //D[i][j] = max(D[i][k],D[k][j]);
    
37.                 double w = max(D[i][k],D[k][j]);
    
38.                 if(w < D[i][j])
    
39.                     D[i][j] = w;
    
40.             }
    
41.         }
    
42.     }
    
43. 
    
44.     return D[1][2];
    
45. 
    
46. }
    
47. 
    
48. int index_v=1;
    
49. int main()
    
50. {
    
51.     int x,y;
    
52.     string blankline;
    
53.     while(cin>>n)
    
54.     {
    
55.         //cout<<"n:"<<n<<endl;
    
56.         if(n == 0)
    
57.             break;
    
58. 
    
59.         memset(V,0,sizeof(V));
    
60.         memset(E,0,sizeof(E));
    
61.         memset(visit,0,sizeof(visit));
    
62.         memset(D,0,sizeof(D));
    
63. 
    
64.         for(int i=1;i<=n;i++)
    
65.         {
    
66.             cin>>x>>y;
    
67.             V[i].x=x;
    
68.             V[i].y=y;
    
69.         }
    
70.         //create edge
    
71.         for(int i=1;i<=n;i++)
    
72.         {
    
73.             for(int j=1;j<=n;j++)
    
74.             {
    
75.                 if( i!=j)
    
76.                     E[i][j] = dis(V[i].x,V[i].y,V[j].x,V[j].y);
    
77.                     D[i][j] = E[i][j];
    
78. 
    
79.             }
    
80.         }
    
81. 
    
82.         //cout<<"create edge OK.."<<endl;
    
83.         double d = floyd();
    
84.         //floyd
    
85.         cout<<"Scenario #"<<index_v++<<endl;
    
86.         //cout<<"Frog Distance = "<<d<<endl;
    
87.         printf("Frog Distance = %.3f\n",d);
    
88.         cout<<endl;
    
89.     }
    
90. }

<script type=text/javascript charset=utf-8 src="http://static.bshare.cn/b/buttonLite.js#style=-1&uuid=&pophcol=3&lang=zh"></script> <script type=text/javascript charset=utf-8 src="http://static.bshare.cn/b/bshareC0.js"></script>

阅读(16) | 评论(0) | 转发(0) |

0

上一篇：poj 1789 prim 图最小生成树算法

下一篇：poj 1125

相关热门文章

• linux 常见服务端口
• 【ROOTFS搭建】busybox的httpd...
• 什么是shell
• linux socket的bug??
• linux的线程是否受到了保护？...

• cpu %和load average是怎样的...
• 如何确定线程使用的端口...
• mysql整形数据类型插入0001数...
• weblogic集群下启动服务有一个...
• Ajax 权限验证

给主人留下些什么吧！~~

评论热议