poj1144-Network（求割点）

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting
several places numbered by integers from 1 to N. No two places have the same number. The lines
are bidirectional and always connect together two places and in each place the lines end in a telephone
exchange. There is one telephone exchange in each place. From each place it is possible to reach
through lines every other place, however it need not be a direct connection, it can go through several
exchanges. From time to time the power supply fails at a place and then the exchange does not operate.
The officials from TLC realized that in such a case it can happen that besides the fact that the place
with the failure is unreachable, this can also cause that some other places cannot connect to each other.
In such a case we will say the place (where the failure occured) is critical. Now the officials are trying
to write a program for finding the number of all such critical places. Help them.
Input
The input file consists of several blocks of lines. Each block describes one network. In the first line
of each block there is the number of places N < 100. Each of the next at most N lines contains the
number of a place followed by the numbers of some places to which there is a direct line from this place.
These at most N lines completely describe the network, i.e., each direct connection of two places in
the network is contained at least in one row. All numbers in one line are separated by one space. Each
block ends with a line containing just ‘0’. The last block has only one line with N = 0.
Output
The output contains for each block except the last in the input file one line containing the number of
critical places.
Sample Input
5
5 1 2 3 4
0
6
2 1 3
5 4 6 2
0
0
Sample Output
1
2
题意：n个点的连通图，一个点发生故障可能导致其他点之间不能相互连通，这个点为关键位置，找出图中关键位置的点的个数。
思路：找割点模板题，就是输入有点烦人
AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=100010;
int head[maxn],ver[maxn*2],Next[maxn*2];
int dfn[maxn],low[maxn],sta[maxn];
int n,m,tot,num,root;
bool cut[maxn];
void add(int x,int y)
{
    ver[++tot]=y;
    Next[tot]=head[x];
    head[x]=tot;
}
void tarjan(int x)
{
    dfn[x]=low[x]=++num;
    int flag=0;
    for(int i=head[x];i;i=Next[i])
    {
        int y=ver[i];
        if(!dfn[y])
        {
            tarjan(y);
            low[x]=min(low[x],low[y]);
            if(low[y]>=dfn[x])
            {
                flag++;
                if(x!=root||flag>1) cut[x]=1;
            }
        }
        else low[x]=min(low[x],dfn[y]);
    }
}
int main()
{
    while(scanf("%d",&m)&&m!=0)
    {
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(head,0,sizeof(head));//一开始赋值为-1了，找了好久都没发现
        memset(cut,0,sizeof(cut));
        int n;
        num=0;
        tot=1;
        while(scanf("%d",&n)&&n)
        {
            while(getchar()!='\n')
            {
                int a;
                scanf("%d",&a);
                add(n,a);
                add(a,n);
            }
        }
        int sum=0;
         for(int i=1;i<=m;i++)
        {
            if(!dfn[i])root=i,tarjan(i);
        }
        for(int i=1; i<=m;i++)
            if(cut[i])
                {
                    sum++;
                    //cout<<i<<endl;
                }
        printf("%d\n",sum);
    }
    return 0;
}

其实发现head赋值的问题也是个偶然，也不知怎么回事就过了，后来又回去仔细看了一下，head的赋值0和-1都没问题，问题是要与tarjan函数中for循环一致，head赋值为0，条件就死是i！=0，赋值为-1就是i！=-1。