POJ 1144 Network （割顶）

解题思路：裸的求割顶，细节见代码

AC代码：

/*
    @Author: wchhlbt
    @Date:   2017/5/24
*/
//#include <bits/stdc++.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <limits>
#include <climits>
#include <cstdio>

#define Fori(x) for(int i=0;i<x;i++)
#define Forj(x) for(int j=0;j<x;j++)
#define maxn 150
#define inf 0x3f3f3f3f
#define ONES(x) __builtin_popcount(x)
using namespace std;

typedef long long ll ;
const double eps =1e-8;
const int mod = 1000000007;
typedef pair<int, int> P;
const double PI = acos(-1.0);
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
//注意将pre、cut清零
//clock要从1开始，不然可能造成对根节点的重复访问
vector <int> e[maxn];
int cut[maxn];
//存放割点，值为1证明是割点，统计个数可以换成set
int pre[maxn];
//存放每个节点的dfs先序值
int low[maxn];
//存放每棵子树能返回的最早祖先
int ans;
//存放割点的个数
int dfs_clock;
int dfs(int u, int fa)
{
    int lowu = pre[u] = dfs_clock++;
    int child = 0;
    for(int i = 0; i<e[u].size(); i++)
    {
        int v = e[u][i];
        if(!pre[v]){
            child++;
            int lowv = dfs(v,u);
            lowu = min(lowu,lowv);
            if(lowv>=pre[u])
                cut[u] = 1;
        }
        else if(pre[v]<pre[u] && v!=fa)
            lowu = min(pre[v],lowu);
    }
    if(fa<0 && child==1)    cut[u] = 0;
    if(cut[u])  ans++;
    return low[u] = lowu;
}
int main()
{
    //freopen("test.txt","r",stdin);
    int n;
    while(~scanf("%d",&n) && n)
    {
        for(int i = 0; i<maxn; i++)
            e[i].clear();
        memset(pre,0,sizeof(pre));
        memset(cut,0,sizeof(cut));
        int u,v;
        while(~scanf("%d",&u) && u){
            while(getchar()!='\n'){
                scanf("%d",&v);
                e[u].push_back(v);
                e[v].push_back(u);
            }
        }
        ans = 0;    dfs_clock = 1;
        //请注意clock要从1开始，不然可能造成对根节点的重复访问
        dfs(1,-1);
        printf("%d\n", ans);
    }
    return 0;
}