pku [1144] zju[1311]

晕。。。今天一道水题刷了n久，wa了好几次。。。。。。。注意输入。。

题目连接：http://acm.pku.edu.cn/JudgeOnline/problem?id=1144

题目大意：给定一个连通图，求出中的割点;

算法：Dfs();

代码：#include<iostream>#include<stdio.h>#include<string.h>using namespace std;const int MAX=105;struct Graph{ int id; int next;};Graph G[MAX*1000];int colour[MAX];int cut[MAX];int Ano[MAX];int live[MAX];int n,G_end,root; void init(){ memset(G,0,sizeof(G)); memset(colour,0,sizeof(colour)); memset(cut,0,sizeof(cut));}void Bulid(int s,int e){ int p; p=s; while(G[p].next) p=G[p].next; G[G_end].id=e; G[p].next=G_end; G_end++; p=e; while(G[p].next) p=G[p].next; G[G_end].id=s; G[p].next=G_end; G_end++;}void Dfs(int x,int father,int deep){ colour[x]=1; live[x]=deep; Ano[x]=live[x]; int tol=0; int p=G[x].next,q; while(p) { q=G[p].id; if(colour[q]==1&&q!=father) Ano[x]=min(Ano[x],live[q]); if(!colour[q]) { Dfs(q,x,deep+1); Ano[x]=min(Ano[x],Ano[q]); tol++; if((x==root&&tol>1)||(x!=root&&Ano[q]>=live[x])) cut[x]=1; } p=G[p].next; } colour[x]=2; } int main(){ while(scanf("%d",&n)&&n) { init(); G_end=n+2; int a,b; while(cin>>a&&a) { char str=getchar(); while(str!='/n') { cin>>b; Bulid(a,b); str=getchar(); } } root=1; Dfs(root,-1,1); int ans=0; for(int i=1;i<=n;i++) if(cut[i]) ans++; printf("%d/n",ans); } return 0;}