poj 2240

ford变种算法，求是否存在正权回路

点击(此处)折叠或打开

1. #include <iostream>
   
2. #include <map>
   
3. #include <cstring>
   
4. 
   
5. using namespace std;
   
6. 
   
7. #define MAX_V (30+1)
   
8. #define inf (2000000000)
   
9. double E[MAX_V][MAX_V];
   
10. double D[MAX_V];
    
11. map<string,int> M;
    
12. 
    
13. 
    
14. int n,m;
    
15. int index_v=1;
    
16. 
    
17. void solve(int index_v)
    
18. {
    
19.     int found = 0;
    
20.     
    
21.     for(int k=1;k<=n;k++)
    
22.     {
    
23.         if(E[1][k] != 0)
    
24.         {
    
25.             D[k] = E[1][k];
    
26.         }
    
27.     }
    
28.     for(int i=1;i<=n-1;i++)
    
29.     {
    
30.         int flag = 0;
    
31.         
    
32.         //foreach u,v
    
33.         for(int j=1;j<=n;j++)
    
34.         {
    
35.             for(int k=1;k<=n;k++)
    
36.             {
    
37.                 if(E[j][k] != 0)
    
38.                 {
    
39.                     //each edge j->k
    
40.                     double kw=D[j] * E[j][k];
    
41.                     if(kw > D[k])
    
42.                     {
    
43.                         D[k]= kw;
    
44.                         flag=1;
    
45.                     }
    
46.                 }
    
47.             }
    
48.         }
    
49. 
    
50.         if(!flag)
    
51.             break;
    
52.     }
    
53.     
    
54.         //foreach u,v
    
55.         for(int j=1;j<=n;j++)
    
56.         {
    
57.             for(int k=1;k<=n;k++)
    
58.             {
    
59.                 if(E[j][k] != 0)
    
60.                 {
    
61.                     //each edge j->k
    
62.                     double kw=D[j] * E[j][k];
    
63.                     if(kw > D[k])
    
64.                     {
    
65.                         D[k]= kw;
    
66.                         cout<<"Case "<<index_v<<": Yes"<<endl;
    
67.                         return;
    
68.                     }
    
69.                 }
    
70.             }
    
71.         }
    
72. 
    
73.     cout<<"Case "<<index_v<<": No"<<endl;
    
74. }
    
75. int main()
    
76. {
    
77.     while(cin>>n)
    
78.     {
    
79. 
    
80.         if(n == 0)
    
81.             break;
    
82. 
    
83.         memset(E,0,sizeof(E));
    
84.         for(int i=1;i<=n;i++)
    
85.         {
    
86.             string name;
    
87.             cin>>name;
    
88. 
    
89.             M[name]=i;
    
90.         }
    
91. 
    
92.         cin>>m;
    
93. 
    
94.         for(int i=1;i<=m;i++)
    
95.         {
    
96.             string namei,namej;
    
97.             double rij;
    
98.             int vi,vj;
    
99. 
    
100.             cin>>namei>>rij>>namej;
     
101. 
     
102.             vi=M[namei];
     
103.             vj=M[namej];
     
104.             E[vi][vj]=rij;
     
105.         }
     
106. 
     
107.         solve(index_v);
     
108.         index_v++;
     
109.     }
     
110. }

<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>

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

0

上一篇：poj 1125

下一篇：poj 2488

相关热门文章

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

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

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

评论热议