HDU 3691 Nubulsa Expo(全局最小割)

Problem Description
You may not hear about Nubulsa, an island country on the Pacific Ocean. Nubulsa is an undeveloped country and it is threatened by the rising of sea level. Scientists predict that Nubulsa will disappear by the year of 2012. Nubulsa government wants to host the 2011 Expo in their country so that even in the future, all the people in the world will remember that there was a country named “Nubulsa”.
As you know, the Expo garden is made up of many museums of different countries. In the Expo garden, there are a lot of bi-directional roads connecting those museums, and all museums are directly or indirectly connected with others. Each road has a tourist capacity which means the maximum number of people who can pass the road per second.
Because Nubulsa is not a rich country and the ticket checking machine is very expensive, the government decides that there must be only one entrance and one exit. The president has already chosen a museum as the entrance of the whole Expo garden, and it’s the Expo chief directory Wuzula’s job to choose a museum as the exit.
Wuzula has been to the Shanghai Expo, and he was frightened by the tremendous “people mountain people sea” there. He wants to control the number of people in his Expo garden. So Wuzula wants to find a suitable museum as the exit so that the “max tourists flow” of the Expo garden is the minimum. If the “max tourist flow” is W, it means that when the Expo garden comes to “stable status”, the number of tourists who enter the entrance per second is at most W. When the Expo garden is in “stable status”, it means that the number of people in the Expo garden remains unchanged.
Because there are only some posters in every museum, so Wuzula assume that all tourists just keep walking and even when they come to a museum, they just walk through, never stay.

Input
There are several test cases, and the input ends with a line of “0 0 0”.

For each test case:
The first line contains three integers N, M and S, representing the number of the museums, the number of roads and the No. of the museum which is chosen as the entrance (all museums are numbered from 1 to N). For example, 5 5 1 means that there are 5 museums and 5 roads connecting them, and the No. 1 museum is the entrance.
The next M lines describe the roads. Each line contains three integers X, Y and K, representing the road connects museum X with museum Y directly and its tourist capacity is K.

Please note:
1<N<=300, 0<M<=50000, 0<S,X,Y<=N, 0<K<=1000000

Output
For each test case, print a line with only an integer W, representing the “max tourist flow” of the Expo garden if Wuzula makes the right choice.

Sample Input
5 5 1
1 2 5
2 4 6
1 3 7
3 4 3
5 1 10
0 0 0

Sample Output
8

题意

N个博物馆，M条路，S为入口，要求你找个出口T，使得从S-T的人流量总和最小，就是S-T的最大流最小，输出最大流

题解

由于最大流=最小割，根据全局最小割可知，两个集合a和b，无论S在哪个集合，都有另1个集合的点满足，所以S根本不用考虑

所以题目就变成求全局最小割

代码

 #include<bits/stdc++.h>
 using namespace std;

 const int maxn=;
 const int INF=0x3f3f3f3f;

 int G[maxn][maxn],wage[maxn],v[maxn];
 bool vis[maxn],in[maxn];
 int n,m;

 int Stoer_wagner()
 {
     int ans=INF;
     for(int i=;i<=n;i++)v[i]=i;
     while(n>)
     {
         memset(vis,,sizeof vis);
         memset(wage,,sizeof wage);
         int k,pre=;
         vis[v[pre]]=true;
         for(int i=;i<=n;i++)
         {
             k=-;
             for(int j=;j<=n;j++)
                 if(!vis[v[j]])
                 {
                     wage[v[j]]+=G[v[pre]][v[j]];
                     if(k==-||wage[v[k]]<wage[v[j]])k=j;
                 }
             vis[v[k]]=true;
             if(i==n-)
             {
                 ans=min(ans,wage[v[k]]);
                 if(ans==)return ans;
                 for(int j=;j<=n;j++)
                 {
                     G[v[pre]][v[j]]+=G[v[j]][v[k]];
                     G[v[j]][v[pre]]+=G[v[j]][v[k]];
                 }
                 v[k]=v[n--];
             }
             pre=k;
         }
     }
     return ans;
 }
 int main()
 {
     while(scanf("%d%d%*d",&n,&m)!=EOF,n||m)
     {
         memset(G,,sizeof G);
         for(int i=,u,v,w;i<m;i++)
         {
             scanf("%d%d%d",&u,&v,&w);
             G[u][v]+=w;
             G[v][u]+=w;
         }
         printf("%d\n",Stoer_wagner());
     }
     return ;
 }