1:learn and rewrite from :
http://blog.csdn.net/zhu_liangwei/article/details/9620715
但是仍有1个case段错误!
2: 使用类似邻接表来表示边,而不是二维数组:
vector<int> edge[1000+5];//edge for every node
3:如果图是联通的,一次dfs完成之后,所有的点都应该被visited过了;如果有没被visited的,说明图不连通:
P.S. 发现PAT支持中文注释了
for(i = 1; i <= n; i++){
if(components == 1){ //求连通区域时,需保持visited 的状态不变
memset(visited, 0, sizeof(visited));
}
visited[i] = 1;//dont' forget fucking this, otherwise dead loop in dfs, you idiot!
depth[i] = dfs(i);
deepest = depth[i] > deepest ? depth[i] : deepest;
int j;
for(j = i; j <= n; j++){//检查有没有未被访问的点,有的话,说明此图不连通,那也不用继续求每个点的depth了
//转去求几个连通区域:每次dfs后,从未被访问的点开始再次dfs
if(visited[j] == 0){
components++;
i = j-1;//不能用i = j;因为外面的循环还会做一次i++
break;
}
}
}
4:本地测试时没加#include <stdlib.h>也可以,但提交PAT时就会说识别不了memset和malloc
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string.h>
using namespace std;
int n;//node number
vector<int> edge[1000+5];//edge for every node
int visited[1000+5];
int dfs(int curNode){
int len = edge[curNode].size();
if(len == 0){
return 0;
}
int i, deep = 0, deepest = 0;
for(i = 0; i < len; i++){
int adj = edge[curNode].at(i);
if(visited[adj] == 0){
//test
//printf("dfs %d into child %d\n",curNode, adj);
visited[adj] = 1;
deep = dfs(adj)+1;//+1表示至少有adj 这一层
}
deepest = deep > deepest ? deep : deepest;
}
return deepest;
}
int main(){
freopen("in.txt","r",stdin);
scanf("%d",&n);
int i;
for(i = 0; i < n-1; i++){
int v1,v2;
scanf("%d %d",&v1,&v2);
edge[v1].push_back(v2);
edge[v2].push_back(v1);
}
int * depth;
depth = (int *)malloc((n+1)*sizeof(int));//1,..,n
int deepest = 0;
int components = 1;//默认连通区域当前1个
for(i = 1; i <= n; i++){
if(components == 1){ //求连通区域时,需保持visited 的状态不变
memset(visited, 0, sizeof(visited));
}
visited[i] = 1;//dont' forget fucking this, otherwise dead loop in dfs, you idiot!
depth[i] = dfs(i);
deepest = depth[i] > deepest ? depth[i] : deepest;
//test
//printf("for %d deep=%d\n",i,deepest[i]);
int j;
for(j = i; j <= n; j++){//检查有没有未被访问的点,有的话,说明此图不连通,那也不用继续求每个点的depth了
//转去求几个连通区域:每次dfs后,从未被访问的点开始再次dfs
if(visited[j] == 0){
components++;
i = j-1;//不能用i = j;因为外面的循环还会做一次i++
break;
}
}
}
if(components == 1){
for(i = 1; i <= n; i++){
if(deepest == depth[i]){
printf("%d\n",i);
}
}
}else{
printf("Error: %d components",components);
}
free(depth);
depth = NULL;
return 0;
}