pku1966 （点的连通度，用最大流求）

http://162.105.81.212/JudgeOnline/problem?id=1966

连通度概念：一个具有n个顶点的图G，在去掉任意k-1个顶点后(1<=k<=n)，所得的子图仍连通，而去掉k个顶点后子图不连通，则称G是k连通图，k称作图G的连通度，记作K(G)。

下面是很清楚的代码：但是奇怪的代码，，样例都没过，居然超时？？？？牛人指点下啊~~~

#include<iostream> using namespace std; #define V 102 #define typec int // type of res const typec inf = 0x3f3f3f3f; // max of res const typec maxw = 1000; // maximum edge weight #define MIN(a, b) (a < b ? a : b) struct edge { int x, y, nxt; typec c; } bf[V]; int ne, head[V], cur[V], ps[V], dep[V]; typec g[V][V], w[V]; int a[V], v[V], na[V]; /*typec mincut(int n) //求割点 { int i, j, pv, zj; typec best = maxw * n * n; for (i = 0; i < n; i++) v[i] = i; // vertex: 0 ~ n-1 while (n > 1) { for (a[v[0]] = 1, i = 1; i < n; i++) { a[v[i]] = 0; na[i - 1] = i; w[i] = g[v[0]][v[i]]; } for (pv = v[0], i = 1; i < n; i++ ) { for (zj = -1, j = 1; j < n; j++ ) if (!a[v[j]] && (zj < 0 || w[j] > w[zj])) zj = j; a[v[zj]] = 1; if (i == n - 1) { if (best > w[zj]) best = w[zj]; for (i = 0; i < n; i++) g[v[i]][pv] = g[pv][v[i]] += g[v[zj]][v[i]]; v[zj] = v[--n]; break; } pv = v[zj]; for (j = 1; j < n; j++) if(!a[v[j]]) w[j] += g[v[zj]][v[j]]; } } return best; }*/ void add(int x, int y, typec c) //插入 { // add an arc(x -> y, c); vertex: 0 ~ n-1; bf[ne].x = x; bf[ne].y = y; bf[ne].c = c; bf[ne].nxt = head[x]; head[x] = ne++; bf[ne].x = y; bf[ne].y = x; bf[ne].c = 0; bf[ne].nxt = head[y]; head[y] = ne++; } typec flow(int n, int s, int t) //求最大流 { typec tr, res = 0; int i, j, k, f, r, top; while (1) { memset(dep, -1, n * sizeof(int)); for (f = dep[ps[0] = s] = 0, r = 1; f != r; ) for (i = ps[f++], j = head[i]; j; j = bf[j].nxt) { if (bf[j].c && -1 == dep[k = bf[j].y]) { dep[k] = dep[i] + 1; ps[r++] = k; if (k == t) { f = r; break; } } } if (-1 == dep[t]) break; memcpy(cur, head, n * sizeof(int)); for (i = s, top = 0; ; ) { if (i == t) { for (k = 0, tr = inf; k < top; ++k) if (bf[ps[k]].c < tr) tr = bf[ps[f = k]].c; for (k = 0; k < top; ++k) bf[ps[k]].c -= tr, bf[ps[k]^1].c += tr; res += tr; i = bf[ps[top = f]].x; } for (j=cur[i]; cur[i]; j = cur[i] = bf[cur[i]].nxt) if (bf[j].c && dep[i]+1 == dep[bf[j].y]) break; if (cur[i]) { ps[top++] = cur[i]; i = bf[cur[i]].y; } else { if (0 == top) break; dep[i] = -1; i = bf[ps[--top]].x; } } } return res; } int main() { int i, j, ans, n, m, a, b, temp; while(scanf("%d%d",&n, &m) != EOF) { memset(bf, 0, sizeof(bf)); memset(head, 0, sizeof(head)); for(i=0; i<n; i++) add(i, i+n-1, 1); //ne = 2; for(i=0; i<m; i++) { scanf(" (%d,%d)",&a,&b); add(a+n, b, inf); add(b+n, a, inf); } ans = inf; for(i=1; i<n; i++) { //ans = min(flow(n*2, 0+n, i), ans); temp = flow(n*2, n, i); if(temp < ans) ans = temp; } if(ans == inf) ans = n; printf("%d/n",ans); } return 0; } 

下面是更清楚的代码，0ms通过的~

#include <algorithm> #include <iostream> using namespace std; #define MAXN 105 #define INF 105 #define MIN(x,y) (x<y?x:y) int map[MAXN][MAXN]; int my_queue[MAXN],queue_first,queue_end;//数组做队列 实现BFS搜索路径 int pre[MAXN],min_flow[MAXN];//记录结点的父节点 当前路径中最小的一段的值，也即限制值 int flow[MAXN][MAXN];//记录当前网络中的流 int max_flow(int num,int map[][MAXN],int source,int sink)//参数含义：结点数量 网络 源点 汇点 { int i, ans=0;//最终结果 memset(flow,0,sizeof(flow)); while(1)//一直循环，直到不存在增广路径 { queue_first=0;//初始化队列 queue_end=0; my_queue[queue_end++]=source; memset(pre,-1,sizeof(pre)); min_flow[source]=INF; pre[source]=-2;//源点的父节点需特殊标示 while(queue_first<queue_end)//BFS寻找增广路径 { int temp=my_queue[queue_first++];//出队列 for(i=0;i<num;i++)//由结点temp往外扩展 { if(pre[i]==-1&&flow[temp][i]<map[temp][i])//当结点i还未被探索到，并且还有可用流量 { my_queue[queue_end++]=i;//加入队列 pre[i]=temp;//标示父节点 min_flow[i]=MIN(min_flow[temp],(map[temp][i]-flow[temp][i]));//求得min_flow } } if(pre[sink]!=-1)//sink的父节点不为初始值，说明BFS已经找到了一条路径 { int k=sink; while(pre[k]>=0) { flow[pre[k]][k]+=min_flow[sink];//将新的流量加入flow flow[k][pre[k]]=-flow[pre[k]][k]; k=pre[k]; } break; } } if(pre[sink]==-1) return ans;//不存在增广路径，返回 else ans+=min_flow[sink]; } } int N,M; int main() { int a, b, ans, temp, i; while(EOF!=scanf("%d%d",&N,&M)) { memset(map,0,sizeof(map)); for(i=0;i<N;i++) map[i][i+N]=1; //先连一条容量为1的边 for(i=0;i<M;i++) { scanf(" (%d,%d)",&a,&b); map[b+N][a]=map[a+N][b]=INF; //连为无穷大的边 } ans=INF; for(i=1;i<N;i++) //求n-1次最大流 { temp = max_flow(N*2, map, 0+N, i); if(ans > temp) ans = temp; //找里面最大流中的的最小流 } if(ans==INF) ans=N; printf("%d/n",ans); } return 0; }